java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label10_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:39:23,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:39:23,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:39:23,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:39:23,702 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:39:23,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:39:23,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:39:23,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:39:23,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:39:23,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:39:23,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:39:23,716 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:39:23,717 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:39:23,719 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:39:23,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:39:23,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:39:23,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:39:23,733 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:39:23,736 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:39:23,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:39:23,741 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:39:23,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:39:23,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:39:23,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:39:23,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:39:23,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:39:23,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:39:23,750 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:39:23,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:39:23,752 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:39:23,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:39:23,753 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:39:23,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:39:23,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:39:23,757 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:39:23,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:39:23,758 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:39:23,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:39:23,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:39:23,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:39:23,789 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:39:23,789 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:39:23,789 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:39:23,790 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:39:23,790 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:39:23,790 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:39:23,790 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:39:23,790 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:39:23,790 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:39:23,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:39:23,794 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:39:23,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:39:23,795 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:39:23,795 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:39:23,795 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:39:23,795 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:39:23,796 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:39:23,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:39:23,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:39:23,796 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:39:23,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:39:23,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:39:23,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:39:23,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:39:23,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:39:23,799 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:39:23,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:39:23,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:39:23,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:39:23,799 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:39:23,800 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:39:23,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:39:23,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:39:23,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:39:23,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:39:23,897 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:39:23,898 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label10_true-unreach-call.c [2018-09-19 12:39:24,266 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1b8482d/4abe428ffa664113af38ed1f40fd4e34/FLAGefe88b38b [2018-09-19 12:39:24,558 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:39:24,559 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label10_true-unreach-call.c [2018-09-19 12:39:24,582 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1b8482d/4abe428ffa664113af38ed1f40fd4e34/FLAGefe88b38b [2018-09-19 12:39:24,605 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1b8482d/4abe428ffa664113af38ed1f40fd4e34 [2018-09-19 12:39:24,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:39:24,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:39:24,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:39:24,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:39:24,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:39:24,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:39:24" (1/1) ... [2018-09-19 12:39:24,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf5491e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:24, skipping insertion in model container [2018-09-19 12:39:24,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:39:24" (1/1) ... [2018-09-19 12:39:24,652 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:39:25,128 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:39:25,147 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:39:25,287 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:39:25,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25 WrapperNode [2018-09-19 12:39:25,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:39:25,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:39:25,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:39:25,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:39:25,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:39:25,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:39:25,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:39:25,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:39:25,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... [2018-09-19 12:39:25,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:39:25,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:39:25,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:39:25,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:39:25,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:39:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:39:25,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:39:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:39:25,805 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:39:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:39:25,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:39:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:39:25,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:39:28,997 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:39:28,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:39:28 BoogieIcfgContainer [2018-09-19 12:39:28,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:39:28,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:39:28,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:39:29,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:39:29,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:39:24" (1/3) ... [2018-09-19 12:39:29,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20c853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:39:29, skipping insertion in model container [2018-09-19 12:39:29,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:39:25" (2/3) ... [2018-09-19 12:39:29,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20c853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:39:29, skipping insertion in model container [2018-09-19 12:39:29,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:39:28" (3/3) ... [2018-09-19 12:39:29,007 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label10_true-unreach-call.c [2018-09-19 12:39:29,017 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:39:29,027 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:39:29,081 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:39:29,082 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:39:29,082 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:39:29,083 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:39:29,083 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:39:29,083 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:39:29,083 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:39:29,084 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:39:29,084 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:39:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:39:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-19 12:39:29,120 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:29,121 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:29,122 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash -973522191, now seen corresponding path program 1 times [2018-09-19 12:39:29,130 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:29,131 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-09-19 12:39:29,134 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:39:29,177 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:29,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:29,552 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:29,554 INFO L272 AbstractInterpreter]: Visited 54 different actions 54 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:39:29,603 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:29,873 INFO L232 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 75.33% of their original sizes. [2018-09-19 12:39:29,874 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:30,138 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:30,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:30,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:39:30,141 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:30,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:39:30,157 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:39:30,158 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:39:30,160 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:39:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:33,018 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:39:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:39:33,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-09-19 12:39:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:33,036 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:39:33,036 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:39:33,044 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:39:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:39:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:39:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:39:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:39:33,115 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 55 [2018-09-19 12:39:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:33,116 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:39:33,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:39:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:39:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-19 12:39:33,122 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:33,123 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:33,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:33,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1518527171, now seen corresponding path program 1 times [2018-09-19 12:39:33,124 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:33,124 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2018-09-19 12:39:33,125 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:33,130 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:33,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:33,233 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:33,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:33,372 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:33,409 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:33,732 INFO L232 lantSequenceWeakener]: Weakened 123 states. On average, predicates are now at 73.9% of their original sizes. [2018-09-19 12:39:33,733 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:34,219 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:34,219 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:34,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:34,220 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:34,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:34,221 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:34,222 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:34,222 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:39:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:37,530 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:39:37,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:37,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2018-09-19 12:39:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:37,540 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:39:37,540 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:39:37,543 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:39:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:39:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:39:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:39:37,586 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 126 [2018-09-19 12:39:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:37,587 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:39:37,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:39:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-19 12:39:37,595 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:37,595 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:37,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1924442500, now seen corresponding path program 1 times [2018-09-19 12:39:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:37,596 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2018-09-19 12:39:37,597 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:37,601 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:37,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:37,676 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:37,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:37,782 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:37,823 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:38,032 INFO L232 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 73.82% of their original sizes. [2018-09-19 12:39:38,032 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:38,795 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:38,795 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:38,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:38,796 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:38,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:38,797 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:38,797 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:38,797 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:39:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:42,179 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:39:42,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:42,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2018-09-19 12:39:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:42,187 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:39:42,187 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:39:42,189 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:39:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:39:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:39:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:39:42,217 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 135 [2018-09-19 12:39:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:42,218 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:39:42,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:39:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-19 12:39:42,224 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:42,224 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:42,224 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1081421700, now seen corresponding path program 1 times [2018-09-19 12:39:42,225 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:42,225 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2018-09-19 12:39:42,226 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:42,230 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:42,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:42,353 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:42,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:42,600 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:42,638 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:42,924 INFO L232 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 73.59% of their original sizes. [2018-09-19 12:39:42,924 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:43,374 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:43,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:43,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:43,375 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:43,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:43,377 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:43,378 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:43,378 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:39:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:48,014 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:39:48,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:48,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 171 [2018-09-19 12:39:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:48,020 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:39:48,021 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:39:48,023 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:39:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:39:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:39:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:39:48,054 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 171 [2018-09-19 12:39:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:48,054 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:39:48,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:39:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-19 12:39:48,058 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:48,059 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:48,059 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -399521981, now seen corresponding path program 1 times [2018-09-19 12:39:48,060 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:48,060 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-19 12:39:48,060 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:48,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:48,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:48,287 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:48,287 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:48,295 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:48,502 INFO L232 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-19 12:39:48,502 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:48,685 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:48,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:48,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:48,686 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:48,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:48,687 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:48,687 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:48,687 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:39:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:50,320 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:39:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:39:50,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-09-19 12:39:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:50,334 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:39:50,335 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:39:50,338 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:39:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:39:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:39:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:39:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:39:50,380 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 190 [2018-09-19 12:39:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:50,380 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:39:50,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:39:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-19 12:39:50,384 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:50,385 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:50,385 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1329799034, now seen corresponding path program 1 times [2018-09-19 12:39:50,386 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:50,386 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-09-19 12:39:50,386 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:50,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:50,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:50,428 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:50,528 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:50,529 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:50,533 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:50,730 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-19 12:39:50,731 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:50,880 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:50,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:50,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:50,881 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:50,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:50,882 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:50,882 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:50,883 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:39:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:53,986 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:39:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:53,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2018-09-19 12:39:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:54,011 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:39:54,012 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:39:54,016 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:39:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:39:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:39:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:39:54,077 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 202 [2018-09-19 12:39:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:54,077 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:39:54,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:39:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-19 12:39:54,082 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:54,082 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:54,082 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1299515716, now seen corresponding path program 1 times [2018-09-19 12:39:54,083 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:54,083 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-09-19 12:39:54,083 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:54,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:54,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:54,136 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:54,233 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:54,234 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:54,271 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:54,459 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.48% of their original sizes. [2018-09-19 12:39:54,459 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:54,667 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:54,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:54,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:54,668 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:54,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:54,668 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:54,668 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:54,669 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:39:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:58,059 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:39:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:58,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 208 [2018-09-19 12:39:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:58,072 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:39:58,073 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:39:58,077 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:39:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:39:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:39:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:39:58,130 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 208 [2018-09-19 12:39:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:58,131 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:39:58,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:39:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-19 12:39:58,136 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:58,136 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:58,136 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1231256931, now seen corresponding path program 1 times [2018-09-19 12:39:58,137 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:58,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-09-19 12:39:58,137 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:58,139 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:58,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:58,186 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:58,324 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:58,324 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:58,351 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:58,660 INFO L232 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 12:39:58,661 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:58,859 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:58,859 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:58,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:58,860 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:58,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:58,860 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:58,861 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:58,861 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:40:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:02,039 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:40:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:02,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-09-19 12:40:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:02,058 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:40:02,058 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:40:02,063 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:40:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:40:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:40:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:40:02,130 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 213 [2018-09-19 12:40:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:02,131 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:40:02,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:40:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-19 12:40:02,136 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:02,136 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:02,136 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2040607403, now seen corresponding path program 1 times [2018-09-19 12:40:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:02,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-09-19 12:40:02,137 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:02,139 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:02,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:02,182 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:02,322 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:02,322 INFO L272 AbstractInterpreter]: Visited 90 different actions 434 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:02,359 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:02,573 INFO L232 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 12:40:02,573 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:02,689 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:02,689 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:02,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:02,689 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:02,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:02,690 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:02,690 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:02,691 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:40:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:05,473 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:40:05,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:05,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2018-09-19 12:40:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:05,488 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:40:05,489 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:40:05,496 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:40:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:40:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:40:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:40:05,579 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 217 [2018-09-19 12:40:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:05,581 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:40:05,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:40:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-19 12:40:05,588 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:05,588 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:05,588 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1490800279, now seen corresponding path program 1 times [2018-09-19 12:40:05,589 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:05,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-19 12:40:05,589 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:05,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:05,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:05,649 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:10,753 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:10,754 INFO L272 AbstractInterpreter]: Visited 96 different actions 464 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:10,765 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:12,234 INFO L232 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 73.43% of their original sizes. [2018-09-19 12:40:12,235 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:12,356 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:12,356 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:12,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:12,357 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:12,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:12,357 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:12,357 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:12,358 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:40:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:14,986 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:40:14,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:14,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 223 [2018-09-19 12:40:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:15,007 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:40:15,007 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:40:15,015 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:40:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:40:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:40:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:40:15,122 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 223 [2018-09-19 12:40:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:15,122 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:40:15,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:40:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-19 12:40:15,129 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:15,130 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:15,130 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash -535725288, now seen corresponding path program 1 times [2018-09-19 12:40:15,131 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:15,131 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-09-19 12:40:15,131 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:15,133 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:15,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:15,257 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:15,516 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:15,517 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:15,560 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:15,778 INFO L232 lantSequenceWeakener]: Weakened 235 states. On average, predicates are now at 73.38% of their original sizes. [2018-09-19 12:40:15,779 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:15,880 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:15,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:15,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:15,881 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:15,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:15,881 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:15,882 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:15,882 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:40:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:19,370 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:40:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:19,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 238 [2018-09-19 12:40:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:19,389 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:40:19,390 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:40:19,399 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 245 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:40:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:40:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:40:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:40:19,504 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 238 [2018-09-19 12:40:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:19,505 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:40:19,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:40:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-19 12:40:19,513 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:19,513 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:19,513 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash -600504652, now seen corresponding path program 1 times [2018-09-19 12:40:19,514 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:19,514 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-09-19 12:40:19,514 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:19,517 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:19,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:19,593 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:19,806 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:19,806 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:40:19,846 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:20,074 INFO L232 lantSequenceWeakener]: Weakened 241 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 12:40:20,075 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:20,169 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:20,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:20,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:20,169 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:20,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:20,170 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:20,170 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:20,170 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:40:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:22,963 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:40:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:22,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2018-09-19 12:40:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:22,985 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:40:22,985 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:40:22,997 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:40:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:40:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:40:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:40:23,120 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 244 [2018-09-19 12:40:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:23,120 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:40:23,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:40:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-19 12:40:23,130 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:23,131 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:23,131 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1853970525, now seen corresponding path program 1 times [2018-09-19 12:40:23,132 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:23,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-09-19 12:40:23,132 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:23,135 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:23,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:23,191 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:23,625 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:23,626 INFO L272 AbstractInterpreter]: Visited 118 different actions 574 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:23,659 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:23,849 INFO L232 lantSequenceWeakener]: Weakened 242 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 12:40:23,849 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:23,941 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:23,941 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:23,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:23,942 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:23,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:23,942 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:23,942 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:23,943 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:40:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:26,771 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:40:26,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:26,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 245 [2018-09-19 12:40:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:26,803 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:40:26,803 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:40:26,817 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:40:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:40:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:40:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:40:26,953 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 245 [2018-09-19 12:40:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:26,953 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:40:26,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:40:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-19 12:40:26,967 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:26,967 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:26,967 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1241394717, now seen corresponding path program 1 times [2018-09-19 12:40:26,968 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:26,968 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-09-19 12:40:26,968 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:26,971 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:26,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:27,013 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:27,257 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:27,257 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:40:27,291 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:27,527 INFO L232 lantSequenceWeakener]: Weakened 274 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 12:40:27,528 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:27,620 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:27,620 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:27,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:27,621 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:27,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:27,621 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:27,621 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:27,622 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:40:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:30,636 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:40:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:30,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 277 [2018-09-19 12:40:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:30,660 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:40:30,660 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:40:30,674 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:40:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:40:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:40:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:40:30,833 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 277 [2018-09-19 12:40:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:30,834 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:40:30,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:40:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-19 12:40:30,850 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:30,851 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:30,851 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:30,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1918786485, now seen corresponding path program 1 times [2018-09-19 12:40:30,852 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:30,852 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-09-19 12:40:30,852 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:30,855 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:30,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:30,904 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:31,087 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:31,087 INFO L272 AbstractInterpreter]: Visited 89 different actions 438 times. Merged at 8 different actions 37 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:31,119 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:31,551 INFO L232 lantSequenceWeakener]: Weakened 283 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 12:40:31,552 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:31,657 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:31,657 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:31,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:31,658 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:31,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:31,659 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:31,659 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:31,659 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:40:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:35,074 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:40:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:35,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2018-09-19 12:40:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:35,114 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:40:35,114 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:40:35,133 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 293 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:40:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:40:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:40:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:40:35,325 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 286 [2018-09-19 12:40:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:35,326 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:40:35,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:40:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-19 12:40:35,344 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:35,344 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:35,345 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1560171963, now seen corresponding path program 1 times [2018-09-19 12:40:35,345 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:35,345 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-09-19 12:40:35,346 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:35,348 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:35,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:35,388 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:35,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:35,563 INFO L272 AbstractInterpreter]: Visited 90 different actions 440 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:35,592 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:35,817 INFO L232 lantSequenceWeakener]: Weakened 291 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 12:40:35,817 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:35,916 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:35,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:35,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:35,916 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:35,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:35,917 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:35,917 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:35,918 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:40:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:39,454 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:40:39,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:40:39,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 294 [2018-09-19 12:40:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:39,492 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:40:39,492 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:40:39,508 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:40:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:40:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:40:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:40:39,715 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 294 [2018-09-19 12:40:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:39,716 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:40:39,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:40:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-19 12:40:39,738 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:39,738 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:39,738 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash 665568513, now seen corresponding path program 1 times [2018-09-19 12:40:39,739 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:39,739 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-09-19 12:40:39,739 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:39,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:39,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:39,798 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:45,269 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:45,269 INFO L272 AbstractInterpreter]: Visited 97 different actions 573 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:45,283 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:46,940 INFO L232 lantSequenceWeakener]: Weakened 293 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 12:40:46,940 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:47,036 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:47,037 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:47,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:47,037 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:47,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:47,038 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:47,038 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:47,038 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:40:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:50,376 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:40:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:50,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 296 [2018-09-19 12:40:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:50,408 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:40:50,408 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:40:50,424 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 303 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:40:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:40:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:40:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:40:50,658 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 296 [2018-09-19 12:40:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:50,659 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:40:50,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:40:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-19 12:40:50,679 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:50,679 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:50,679 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1033741496, now seen corresponding path program 1 times [2018-09-19 12:40:50,680 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:50,680 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-09-19 12:40:50,680 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:50,682 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:50,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:50,723 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:50,896 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:50,897 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:50,901 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:51,120 INFO L232 lantSequenceWeakener]: Weakened 300 states. On average, predicates are now at 73.27% of their original sizes. [2018-09-19 12:40:51,120 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:51,452 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:51,452 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:51,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:51,452 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:51,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:51,453 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:51,453 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:51,454 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:40:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:54,660 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:40:54,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:54,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 303 [2018-09-19 12:40:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:54,690 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:40:54,690 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:40:54,708 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 310 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:40:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:40:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:40:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:40:54,928 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 303 [2018-09-19 12:40:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:54,929 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:40:54,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:40:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-19 12:40:54,949 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:54,949 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:40:54,950 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash 195370037, now seen corresponding path program 1 times [2018-09-19 12:40:54,950 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:54,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 307 with the following transitions: [2018-09-19 12:40:54,951 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:54,952 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:54,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:54,990 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:00,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:00,508 INFO L272 AbstractInterpreter]: Visited 97 different actions 568 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:00,516 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:02,139 INFO L232 lantSequenceWeakener]: Weakened 303 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 12:41:02,139 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:02,264 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:02,264 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:02,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:02,264 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:02,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:02,265 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:02,265 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:02,265 INFO L87 Difference]: Start difference. First operand 15014 states and 19527 transitions. Second operand 10 states. [2018-09-19 12:41:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:05,124 INFO L93 Difference]: Finished difference Result 31248 states and 40901 transitions. [2018-09-19 12:41:05,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:05,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 306 [2018-09-19 12:41:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:05,156 INFO L225 Difference]: With dead ends: 31248 [2018-09-19 12:41:05,157 INFO L226 Difference]: Without dead ends: 16384 [2018-09-19 12:41:05,175 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 313 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2018-09-19 12:41:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 16100. [2018-09-19 12:41:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2018-09-19 12:41:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 21070 transitions. [2018-09-19 12:41:05,431 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 21070 transitions. Word has length 306 [2018-09-19 12:41:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:05,432 INFO L480 AbstractCegarLoop]: Abstraction has 16100 states and 21070 transitions. [2018-09-19 12:41:05,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 21070 transitions. [2018-09-19 12:41:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-19 12:41:05,452 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:05,453 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:05,453 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1459879293, now seen corresponding path program 1 times [2018-09-19 12:41:05,453 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:05,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 311 with the following transitions: [2018-09-19 12:41:05,454 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:05,456 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:05,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:05,502 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:11,928 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:11,928 INFO L272 AbstractInterpreter]: Visited 97 different actions 664 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:11,937 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:13,753 INFO L232 lantSequenceWeakener]: Weakened 307 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 12:41:13,753 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:13,924 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:13,924 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:13,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:13,925 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:13,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:13,925 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:13,925 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:13,925 INFO L87 Difference]: Start difference. First operand 16100 states and 21070 transitions. Second operand 10 states. [2018-09-19 12:41:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:17,664 INFO L93 Difference]: Finished difference Result 33283 states and 43657 transitions. [2018-09-19 12:41:17,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:17,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 310 [2018-09-19 12:41:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:17,698 INFO L225 Difference]: With dead ends: 33283 [2018-09-19 12:41:17,699 INFO L226 Difference]: Without dead ends: 17333 [2018-09-19 12:41:17,718 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 317 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-09-19 12:41:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17020. [2018-09-19 12:41:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-09-19 12:41:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 22326 transitions. [2018-09-19 12:41:17,949 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 22326 transitions. Word has length 310 [2018-09-19 12:41:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:17,949 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 22326 transitions. [2018-09-19 12:41:17,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 22326 transitions. [2018-09-19 12:41:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-09-19 12:41:17,959 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:17,960 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:17,960 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1784759061, now seen corresponding path program 1 times [2018-09-19 12:41:17,960 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:17,961 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-09-19 12:41:17,961 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:17,964 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:17,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:18,033 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:18,324 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:18,324 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:18,359 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:18,614 INFO L232 lantSequenceWeakener]: Weakened 310 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 12:41:18,614 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:18,699 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:18,699 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:18,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:18,700 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:18,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:18,700 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:18,700 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:18,700 INFO L87 Difference]: Start difference. First operand 17020 states and 22326 transitions. Second operand 10 states. [2018-09-19 12:41:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:22,648 INFO L93 Difference]: Finished difference Result 35215 states and 46290 transitions. [2018-09-19 12:41:22,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:22,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 313 [2018-09-19 12:41:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:22,687 INFO L225 Difference]: With dead ends: 35215 [2018-09-19 12:41:22,687 INFO L226 Difference]: Without dead ends: 18345 [2018-09-19 12:41:22,709 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 320 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18345 states. [2018-09-19 12:41:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18345 to 17954. [2018-09-19 12:41:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2018-09-19 12:41:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 23579 transitions. [2018-09-19 12:41:22,994 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 23579 transitions. Word has length 313 [2018-09-19 12:41:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:22,995 INFO L480 AbstractCegarLoop]: Abstraction has 17954 states and 23579 transitions. [2018-09-19 12:41:22,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 23579 transitions. [2018-09-19 12:41:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-19 12:41:23,007 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:23,007 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:23,007 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1782531723, now seen corresponding path program 1 times [2018-09-19 12:41:23,008 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:23,008 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-09-19 12:41:23,008 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:23,010 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:23,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:23,044 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:23,285 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:23,285 INFO L272 AbstractInterpreter]: Visited 119 different actions 704 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:23,292 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:23,529 INFO L232 lantSequenceWeakener]: Weakened 315 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 12:41:23,530 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:23,647 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:23,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:23,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:23,648 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:23,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:23,648 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:23,648 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:23,649 INFO L87 Difference]: Start difference. First operand 17954 states and 23579 transitions. Second operand 10 states. [2018-09-19 12:41:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:27,583 INFO L93 Difference]: Finished difference Result 37767 states and 49724 transitions. [2018-09-19 12:41:27,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:27,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 318 [2018-09-19 12:41:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:27,617 INFO L225 Difference]: With dead ends: 37767 [2018-09-19 12:41:27,617 INFO L226 Difference]: Without dead ends: 19963 [2018-09-19 12:41:27,633 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 325 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2018-09-19 12:41:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19520. [2018-09-19 12:41:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19520 states. [2018-09-19 12:41:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 25686 transitions. [2018-09-19 12:41:27,894 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 25686 transitions. Word has length 318 [2018-09-19 12:41:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:27,894 INFO L480 AbstractCegarLoop]: Abstraction has 19520 states and 25686 transitions. [2018-09-19 12:41:27,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 25686 transitions. [2018-09-19 12:41:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-19 12:41:27,906 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:27,906 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:27,906 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1791629041, now seen corresponding path program 1 times [2018-09-19 12:41:27,907 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:27,907 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 333 with the following transitions: [2018-09-19 12:41:27,907 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:27,910 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:27,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:27,946 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:28,241 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:28,241 INFO L272 AbstractInterpreter]: Visited 119 different actions 819 times. Merged at 8 different actions 52 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:28,249 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:28,547 INFO L232 lantSequenceWeakener]: Weakened 329 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 12:41:28,548 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:28,753 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:28,753 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:28,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:28,754 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:28,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:28,754 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:28,754 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:28,754 INFO L87 Difference]: Start difference. First operand 19520 states and 25686 transitions. Second operand 10 states. [2018-09-19 12:41:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:32,398 INFO L93 Difference]: Finished difference Result 40792 states and 53797 transitions. [2018-09-19 12:41:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:32,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 332 [2018-09-19 12:41:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:32,433 INFO L225 Difference]: With dead ends: 40792 [2018-09-19 12:41:32,433 INFO L226 Difference]: Without dead ends: 21422 [2018-09-19 12:41:32,451 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 339 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2018-09-19 12:41:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 21074. [2018-09-19 12:41:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21074 states. [2018-09-19 12:41:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 27733 transitions. [2018-09-19 12:41:32,686 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 27733 transitions. Word has length 332 [2018-09-19 12:41:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:32,687 INFO L480 AbstractCegarLoop]: Abstraction has 21074 states and 27733 transitions. [2018-09-19 12:41:32,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 27733 transitions. [2018-09-19 12:41:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-09-19 12:41:32,702 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:32,702 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:32,702 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1252460222, now seen corresponding path program 1 times [2018-09-19 12:41:32,703 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:32,703 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 334 with the following transitions: [2018-09-19 12:41:32,703 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:32,706 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:32,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:32,745 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:32,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:41:33,000 INFO L272 AbstractInterpreter]: Visited 130 different actions 636 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:33,009 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:41:33,053 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:41:33,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:41:33 BoogieIcfgContainer [2018-09-19 12:41:33,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:41:33,055 INFO L168 Benchmark]: Toolchain (without parser) took 128436.54 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -507.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-19 12:41:33,057 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:41:33,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:33,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:33,059 INFO L168 Benchmark]: Boogie Preprocessor took 275.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -863.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:33,060 INFO L168 Benchmark]: RCFGBuilder took 3273.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:41:33,060 INFO L168 Benchmark]: TraceAbstraction took 124055.08 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 195.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-19 12:41:33,065 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 99.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 275.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -863.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3273.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124055.08 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 195.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 148]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND TRUE (((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L148] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 123.9s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 75.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3940 SDtfs, 16743 SDslu, 8713 SDs, 0 SdLazy, 47682 SolverSat, 4754 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.8s Time, PredicateUnifierStatistics: 46 DeclaredPredicates, 5652 GetRequests, 5299 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21074occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 28.8s AbstIntTime, 24 AbstIntIterations, 23 AbstIntStrong, 0.9968069157301499 AbsIntWeakeningRatio, 0.1113341850702683 AbsIntAvgWeakeningVarsNumRemoved, 21.68844679686074 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 3250 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label10_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-41-33-080.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label10_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-41-33-080.csv Received shutdown request...