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_label22_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:41:07,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:41:07,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:41:07,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:41:07,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:41:07,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:41:07,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:41:07,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:41:07,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:41:07,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:41:07,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:41:07,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:41:07,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:41:07,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:41:08,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:41:08,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:41:08,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:41:08,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:41:08,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:41:08,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:41:08,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:41:08,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:41:08,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:41:08,020 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:41:08,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:41:08,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:41:08,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:41:08,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:41:08,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:41:08,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:41:08,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:41:08,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:41:08,029 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:41:08,029 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:41:08,031 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:41:08,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:41:08,032 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:41:08,058 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:41:08,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:41:08,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:41:08,063 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:41:08,063 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:41:08,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:41:08,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:41:08,063 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:41:08,064 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:41:08,064 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:41:08,064 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:41:08,064 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:41:08,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:41:08,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:41:08,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:41:08,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:41:08,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:41:08,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:41:08,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:41:08,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:41:08,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:41:08,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:41:08,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:41:08,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:41:08,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:41:08,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:41:08,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:41:08,070 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:41:08,070 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:41:08,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:41:08,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:41:08,071 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:41:08,071 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:41:08,071 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:41:08,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:41:08,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:41:08,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:41:08,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:41:08,140 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:41:08,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label22_true-unreach-call.c [2018-09-19 12:41:08,487 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f807ddc/2438d683c9c8495eb74662bcf9cf648a/FLAG98fd403e3 [2018-09-19 12:41:08,733 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:41:08,734 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label22_true-unreach-call.c [2018-09-19 12:41:08,746 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f807ddc/2438d683c9c8495eb74662bcf9cf648a/FLAG98fd403e3 [2018-09-19 12:41:08,773 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f807ddc/2438d683c9c8495eb74662bcf9cf648a [2018-09-19 12:41:08,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:41:08,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:41:08,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:41:08,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:41:08,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:41:08,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:41:08" (1/1) ... [2018-09-19 12:41:08,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a614e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:08, skipping insertion in model container [2018-09-19 12:41:08,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:41:08" (1/1) ... [2018-09-19 12:41:08,819 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:41:09,363 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:41:09,382 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:41:09,521 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:41:09,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09 WrapperNode [2018-09-19 12:41:09,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:41:09,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:41:09,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:41:09,601 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:41:09,612 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:41:09" (1/1) ... [2018-09-19 12:41:09,645 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:41:09" (1/1) ... [2018-09-19 12:41:09,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:41:09,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:41:09,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:41:09,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:41:09,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (1/1) ... [2018-09-19 12:41:09,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (1/1) ... [2018-09-19 12:41:09,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (1/1) ... [2018-09-19 12:41:09,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (1/1) ... [2018-09-19 12:41:09,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (1/1) ... [2018-09-19 12:41:09,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (1/1) ... [2018-09-19 12:41:09,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (1/1) ... [2018-09-19 12:41:09,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:41:09,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:41:09,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:41:09,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:41:09,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (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:41:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:41:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:41:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:41:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:41:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:41:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:41:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:41:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:41:13,175 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:41:13,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:41:13 BoogieIcfgContainer [2018-09-19 12:41:13,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:41:13,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:41:13,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:41:13,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:41:13,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:41:08" (1/3) ... [2018-09-19 12:41:13,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a80e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:41:13, skipping insertion in model container [2018-09-19 12:41:13,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:41:09" (2/3) ... [2018-09-19 12:41:13,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a80e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:41:13, skipping insertion in model container [2018-09-19 12:41:13,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:41:13" (3/3) ... [2018-09-19 12:41:13,184 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label22_true-unreach-call.c [2018-09-19 12:41:13,192 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:41:13,200 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:41:13,249 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:41:13,250 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:41:13,250 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:41:13,250 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:41:13,251 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:41:13,251 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:41:13,252 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:41:13,252 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:41:13,252 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:41:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:41:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-19 12:41:13,287 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:13,289 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] [2018-09-19 12:41:13,290 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 625689180, now seen corresponding path program 1 times [2018-09-19 12:41:13,298 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:13,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-09-19 12:41:13,302 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], [253], [255], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:41:13,344 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:13,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:13,668 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:13,670 INFO L272 AbstractInterpreter]: Visited 43 different actions 43 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:41:13,721 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:13,921 INFO L232 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 74.8% of their original sizes. [2018-09-19 12:41:13,921 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:14,033 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:14,035 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:14,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:41:14,035 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:14,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:41:14,051 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:41:14,052 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:41:14,055 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:41:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:16,222 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:41:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:41:16,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-09-19 12:41:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:16,240 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:41:16,241 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:41:16,248 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:41:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:41:16,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:41:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:41:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:41:16,324 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 44 [2018-09-19 12:41:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:16,324 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:41:16,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:41:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:41:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-19 12:41:16,331 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:16,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1967158933, now seen corresponding path program 1 times [2018-09-19 12:41:16,332 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:16,333 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-09-19 12:41:16,333 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:16,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:16,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:16,476 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:16,607 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:16,607 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:41:16,649 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:16,912 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 73.57% of their original sizes. [2018-09-19 12:41:16,912 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:17,681 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:17,681 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:17,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:17,682 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:17,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:17,685 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:17,685 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:17,685 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:41:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:23,661 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:41:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:41:23,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-09-19 12:41:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:23,668 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:41:23,668 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:41:23,672 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:41:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:41:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:41:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:41:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:41:23,727 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 115 [2018-09-19 12:41:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:23,728 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:41:23,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:41:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-19 12:41:23,732 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:23,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,733 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash -344279760, now seen corresponding path program 1 times [2018-09-19 12:41:23,733 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:23,734 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2018-09-19 12:41:23,734 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:23,738 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:23,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:23,810 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:23,905 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:23,905 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:41:23,943 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:24,130 INFO L232 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 73.51% of their original sizes. [2018-09-19 12:41:24,131 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:24,890 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:24,891 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:24,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:24,891 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:24,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:24,892 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:24,892 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:24,893 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:41:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:29,017 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:41:29,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:29,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-09-19 12:41:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:29,024 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:41:29,024 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:41:29,027 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:41:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:41:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:41:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:41:29,061 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 124 [2018-09-19 12:41:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:29,061 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:41:29,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:41:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-19 12:41:29,067 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:29,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash -679371352, now seen corresponding path program 1 times [2018-09-19 12:41:29,068 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:29,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-09-19 12:41:29,068 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:29,073 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:29,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:29,197 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:29,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:29,489 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:41:29,530 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:29,848 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 73.33% of their original sizes. [2018-09-19 12:41:29,849 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:30,674 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:30,674 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:30,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:30,675 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:30,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:30,676 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:30,676 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:30,677 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:41:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:34,521 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:41:34,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:41:34,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-09-19 12:41:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:34,527 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:41:34,528 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:41:34,530 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:41:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:41:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:41:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:41:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:41:34,564 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 160 [2018-09-19 12:41:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:34,564 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:41:34,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:41:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-19 12:41:34,568 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:34,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,569 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash 606530795, now seen corresponding path program 1 times [2018-09-19 12:41:34,569 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:34,570 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-09-19 12:41:34,570 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:34,575 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:34,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:34,826 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:34,827 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:41:34,866 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:35,066 INFO L232 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 12:41:35,066 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:35,245 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:35,246 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:35,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:35,246 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:35,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:35,247 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:35,247 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:35,247 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:41:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:37,640 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:41:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:41:37,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-09-19 12:41:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:37,656 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:41:37,656 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:41:37,659 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 170 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:41:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:41:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:41:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:41:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:41:37,707 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 179 [2018-09-19 12:41:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:37,708 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:41:37,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:41:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-19 12:41:37,711 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:37,712 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, 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] [2018-09-19 12:41:37,712 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1994263801, now seen corresponding path program 1 times [2018-09-19 12:41:37,712 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:37,713 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-09-19 12:41:37,713 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:37,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:37,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:37,768 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:37,903 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:37,904 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:41:37,941 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:38,162 INFO L232 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 12:41:38,163 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:38,353 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:38,354 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:38,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:38,354 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:38,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:38,355 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:38,355 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:38,355 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:41:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:40,310 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:41:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:40,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-09-19 12:41:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:40,324 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:41:40,324 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:41:40,328 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 182 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:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:41:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:41:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:41:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:41:40,385 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 191 [2018-09-19 12:41:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:40,386 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:41:40,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:41:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-19 12:41:40,390 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:40,390 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, 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] [2018-09-19 12:41:40,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:40,390 INFO L82 PathProgramCache]: Analyzing trace with hash -595049421, now seen corresponding path program 1 times [2018-09-19 12:41:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:40,391 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-09-19 12:41:40,391 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:40,393 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:40,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:40,440 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:40,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:40,547 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:41:40,583 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:40,777 INFO L232 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 12:41:40,778 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:40,915 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:40,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:40,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:40,916 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:40,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:40,917 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:40,917 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:40,917 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:41:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:44,802 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:41:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:44,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 197 [2018-09-19 12:41:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:44,813 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:41:44,813 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:41:44,818 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 188 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:41:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:41:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:41:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:41:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:41:44,866 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 197 [2018-09-19 12:41:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:44,867 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:41:44,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:41:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-19 12:41:44,871 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:44,872 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, 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] [2018-09-19 12:41:44,872 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1673424808, now seen corresponding path program 1 times [2018-09-19 12:41:44,872 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:44,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-09-19 12:41:44,873 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:44,875 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:44,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:44,928 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:45,077 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:45,077 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:41:45,115 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:45,454 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 12:41:45,455 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:45,731 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:45,731 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:45,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:45,732 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:45,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:45,732 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:45,732 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:45,733 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:41:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:49,257 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:41:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:49,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2018-09-19 12:41:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:49,278 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:41:49,278 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:41:49,284 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 193 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:41:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:41:49,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:41:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:41:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:41:49,359 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 202 [2018-09-19 12:41:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:49,361 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:41:49,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:41:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-19 12:41:49,366 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:49,366 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, 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] [2018-09-19 12:41:49,366 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037088, now seen corresponding path program 1 times [2018-09-19 12:41:49,366 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:49,367 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-09-19 12:41:49,367 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:49,369 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:49,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:49,414 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:49,573 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:49,573 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:41:49,610 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:49,826 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 12:41:49,826 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:50,072 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:50,072 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:50,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:50,073 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:50,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:50,073 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:50,073 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:50,074 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:41:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:52,271 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:41:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:52,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-09-19 12:41:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:52,293 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:41:52,293 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:41:52,301 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 197 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:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:41:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:41:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:41:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:41:52,394 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 206 [2018-09-19 12:41:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:52,396 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:41:52,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:41:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-19 12:41:52,403 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:52,404 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, 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] [2018-09-19 12:41:52,404 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1805242740, now seen corresponding path program 1 times [2018-09-19 12:41:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:52,405 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-09-19 12:41:52,405 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:41:52,408 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:52,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:52,528 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:58,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:58,050 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:41:58,056 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:59,487 INFO L232 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 12:41:59,487 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:59,588 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:59,588 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:59,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:59,589 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:59,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:59,589 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:59,589 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:59,590 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:42:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:02,484 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:42:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:02,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 212 [2018-09-19 12:42:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:02,509 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:42:02,509 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:42:02,518 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 203 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:42:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:42:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:42:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:42:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:42:02,628 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 212 [2018-09-19 12:42:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:02,629 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:42:02,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:42:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-19 12:42:02,635 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:02,636 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, 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] [2018-09-19 12:42:02,636 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1845255721, now seen corresponding path program 1 times [2018-09-19 12:42:02,636 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:02,636 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-09-19 12:42:02,637 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:02,639 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:02,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:02,681 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:02,925 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:02,925 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:42:02,967 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:03,151 INFO L232 lantSequenceWeakener]: Weakened 224 states. On average, predicates are now at 73.19% of their original sizes. [2018-09-19 12:42:03,151 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:03,240 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:03,240 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:03,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:03,240 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:03,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:03,241 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:03,241 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:03,241 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:42:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:06,539 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:42:06,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:06,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 227 [2018-09-19 12:42:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:06,564 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:42:06,564 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:42:06,574 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 218 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:42:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:42:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:42:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:42:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:42:06,679 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 227 [2018-09-19 12:42:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:06,680 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:42:06,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:42:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-19 12:42:06,687 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:06,687 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, 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] [2018-09-19 12:42:06,687 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash 234562235, now seen corresponding path program 1 times [2018-09-19 12:42:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:06,688 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-09-19 12:42:06,688 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:06,691 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:06,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:06,770 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:06,993 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:06,993 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:42:07,022 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:07,235 INFO L232 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 12:42:07,235 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:07,341 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:07,341 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:07,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:07,342 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:07,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:07,342 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:07,342 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:07,343 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:42:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:10,636 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:42:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:10,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 233 [2018-09-19 12:42:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:10,662 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:42:10,662 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:42:10,674 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 240 GetRequests, 224 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:42:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:42:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:42:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:42:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:42:10,902 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 233 [2018-09-19 12:42:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:10,903 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:42:10,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:42:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-19 12:42:10,911 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:10,912 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, 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] [2018-09-19 12:42:10,912 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:10,912 INFO L82 PathProgramCache]: Analyzing trace with hash -592071320, now seen corresponding path program 1 times [2018-09-19 12:42:10,912 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:10,913 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-09-19 12:42:10,913 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:10,916 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:10,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:10,963 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:11,231 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:11,232 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:42:11,265 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:11,508 INFO L232 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 12:42:11,509 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:11,708 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:11,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:11,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:11,709 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:11,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:11,710 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:11,710 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:11,710 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:42:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:14,304 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:42:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:14,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 234 [2018-09-19 12:42:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:14,324 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:42:14,324 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:42:14,337 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 225 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:42:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:42:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:42:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:42:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:42:14,467 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 234 [2018-09-19 12:42:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:14,467 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:42:14,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:42:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-19 12:42:14,479 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:14,480 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, 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] [2018-09-19 12:42:14,480 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:14,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1311046440, now seen corresponding path program 1 times [2018-09-19 12:42:14,481 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:14,481 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-09-19 12:42:14,481 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:14,484 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:14,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:14,526 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:14,827 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:14,828 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:42:14,856 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:15,163 INFO L232 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 73.12% of their original sizes. [2018-09-19 12:42:15,163 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:15,392 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:15,392 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:15,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:15,393 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:15,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:15,393 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:15,393 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:15,394 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:42:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:18,611 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:42:18,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:18,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 266 [2018-09-19 12:42:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:18,640 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:42:18,641 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:42:18,655 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:42:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:42:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:42:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:42:19,005 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 266 [2018-09-19 12:42:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:19,005 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:42:19,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:42:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-19 12:42:19,019 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:19,020 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:42:19,020 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 295342267, now seen corresponding path program 1 times [2018-09-19 12:42:19,021 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:19,021 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-09-19 12:42:19,021 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:19,025 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:19,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:19,069 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:19,244 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:19,244 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:42:19,272 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:19,560 INFO L232 lantSequenceWeakener]: Weakened 272 states. On average, predicates are now at 73.14% of their original sizes. [2018-09-19 12:42:19,561 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:19,807 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:19,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:19,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:19,808 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:19,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:19,809 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:19,809 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:19,809 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:42:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:23,326 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:42:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:23,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 275 [2018-09-19 12:42:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:23,362 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:42:23,362 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:42:23,380 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 282 GetRequests, 266 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:42:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:42:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:42:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:42:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:42:23,568 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 275 [2018-09-19 12:42:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:23,569 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:42:23,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:42:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-19 12:42:23,585 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:23,586 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:42:23,586 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:23,586 INFO L82 PathProgramCache]: Analyzing trace with hash 674064683, now seen corresponding path program 1 times [2018-09-19 12:42:23,586 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:23,587 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-09-19 12:42:23,587 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:23,589 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:23,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:23,630 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:23,801 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:23,801 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:42:23,839 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:24,089 INFO L232 lantSequenceWeakener]: Weakened 280 states. On average, predicates are now at 73.13% of their original sizes. [2018-09-19 12:42:24,089 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:24,222 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:24,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:24,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:24,223 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:24,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:24,224 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:24,224 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:24,224 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:42:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:27,247 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:42:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:42:27,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2018-09-19 12:42:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:27,281 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:42:27,282 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:42:27,297 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 290 GetRequests, 274 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:42:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:42:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:42:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:42:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:42:27,505 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 283 [2018-09-19 12:42:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:27,506 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:42:27,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:42:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-19 12:42:27,523 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:27,523 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:42:27,524 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash -393554833, now seen corresponding path program 1 times [2018-09-19 12:42:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:27,524 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-09-19 12:42:27,525 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:27,528 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:27,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:27,584 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:33,111 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:33,111 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:42:33,126 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:35,004 INFO L232 lantSequenceWeakener]: Weakened 282 states. On average, predicates are now at 73.13% of their original sizes. [2018-09-19 12:42:35,004 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:35,090 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:35,091 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:35,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:35,091 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:35,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:35,091 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:35,092 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:35,092 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:42:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:38,711 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:42:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:38,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 285 [2018-09-19 12:42:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:38,742 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:42:38,742 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:42:38,758 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 292 GetRequests, 276 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:42:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:42:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:42:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:42:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:42:38,997 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 285 [2018-09-19 12:42:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:38,998 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:42:38,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:42:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-19 12:42:39,012 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:39,013 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:42:39,013 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:39,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2146060804, now seen corresponding path program 1 times [2018-09-19 12:42:39,013 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:39,014 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-09-19 12:42:39,014 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:39,016 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:39,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:39,055 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:39,220 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:39,220 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:42:39,226 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:39,461 INFO L232 lantSequenceWeakener]: Weakened 289 states. On average, predicates are now at 73.12% of their original sizes. [2018-09-19 12:42:39,462 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:39,568 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:39,569 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:39,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:39,569 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:39,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:39,569 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:39,570 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:39,572 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:42:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:42,264 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:42:42,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:42,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 292 [2018-09-19 12:42:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:42,297 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:42:42,298 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:42:42,316 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 299 GetRequests, 283 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:42:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:42:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:42:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:42:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:42:42,552 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 292 [2018-09-19 12:42:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:42,553 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:42:42,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:42:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-19 12:42:42,566 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:42,567 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:42:42,567 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:42,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1532880379, now seen corresponding path program 1 times [2018-09-19 12:42:42,567 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:42,567 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-09-19 12:42:42,568 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [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:42:42,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:42,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:42,611 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:47,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:42:47,995 INFO L272 AbstractInterpreter]: Visited 98 different actions 570 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:42:48,004 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:42:48,046 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:42:48,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:42:48 BoogieIcfgContainer [2018-09-19 12:42:48,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:42:48,048 INFO L168 Benchmark]: Toolchain (without parser) took 99262.26 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 12:42:48,050 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:42:48,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.85 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:42:48,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.15 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:42:48,052 INFO L168 Benchmark]: Boogie Preprocessor took 260.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -854.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:42:48,052 INFO L168 Benchmark]: RCFGBuilder took 3180.34 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:42:48,053 INFO L168 Benchmark]: TraceAbstraction took 94870.64 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 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 12:42:48,058 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.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.85 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 133.15 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 260.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -854.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3180.34 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 94870.64 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 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 115]: 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 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 TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L297] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L298] a10 = 4 [L300] 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 TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L272] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L273] a10 = 1 [L274] a19 = 7 [L276] 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 TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)) [L115] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 94.8s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 58.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3206 SDtfs, 12848 SDslu, 6405 SDs, 0 SdLazy, 35645 SolverSat, 3360 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.3s Time, PredicateUnifierStatistics: 36 DeclaredPredicates, 3840 GetRequests, 3567 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15014occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 21.4s AbstIntTime, 19 AbstIntIterations, 18 AbstIntStrong, 0.9965691951441579 AbsIntWeakeningRatio, 0.1230105206366334 AbsIntAvgWeakeningVarsNumRemoved, 21.451038575667656 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1471 StatesRemovedByMinimization, 18 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_label22_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-42-48-072.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label22_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-42-48-072.csv Received shutdown request...