/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:53:09,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:53:09,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:53:09,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:53:09,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:53:09,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:53:09,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:53:09,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:53:09,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:53:09,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:53:09,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:53:09,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:53:09,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:53:09,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:53:09,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:53:09,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:53:09,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:53:09,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:53:09,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:53:09,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:53:09,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:53:09,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:53:09,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:53:09,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:53:09,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:53:09,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:53:09,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:53:09,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:53:09,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:53:09,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:53:09,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:53:09,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:53:09,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:53:09,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:53:09,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:53:09,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:53:09,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:53:09,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:53:09,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:53:09,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:53:09,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:53:09,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:53:09,606 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:53:09,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:53:09,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:53:09,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:53:09,611 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:53:09,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:53:09,611 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:53:09,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:53:09,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:53:09,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:53:09,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:53:09,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:53:09,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:53:09,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:53:09,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:53:09,615 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:53:09,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:53:09,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:53:09,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:53:09,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:53:09,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:53:09,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:53:09,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:53:09,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:53:09,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:53:09,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:53:09,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:53:09,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:53:09,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:53:09,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-27 21:53:10,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:53:10,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:53:10,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:53:10,112 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:53:10,112 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:53:10,113 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-08-27 21:53:10,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/041c66d20/f8540928300f437689c88881bb496f4d/FLAG4df27c0f1 [2020-08-27 21:53:10,883 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:53:10,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-08-27 21:53:10,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/041c66d20/f8540928300f437689c88881bb496f4d/FLAG4df27c0f1 [2020-08-27 21:53:11,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/041c66d20/f8540928300f437689c88881bb496f4d [2020-08-27 21:53:11,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:53:11,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:53:11,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:53:11,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:53:11,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:53:11,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:11,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e164ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11, skipping insertion in model container [2020-08-27 21:53:11,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:11,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:53:11,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:53:11,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:53:11,659 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:53:11,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:53:11,897 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:53:11,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11 WrapperNode [2020-08-27 21:53:11,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:53:11,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:53:11,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:53:11,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:53:11,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:11,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:11,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:11,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:11,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:12,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:12,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... [2020-08-27 21:53:12,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:53:12,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:53:12,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:53:12,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:53:12,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-08-27 21:53:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:53:12,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:53:12,144 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-27 21:53:12,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:53:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-27 21:53:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:53:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:53:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-27 21:53:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:53:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:53:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:53:13,361 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:53:13,361 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-27 21:53:13,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:53:13 BoogieIcfgContainer [2020-08-27 21:53:13,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:53:13,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:53:13,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:53:13,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:53:13,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:53:11" (1/3) ... [2020-08-27 21:53:13,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:53:13, skipping insertion in model container [2020-08-27 21:53:13,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:53:11" (2/3) ... [2020-08-27 21:53:13,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:53:13, skipping insertion in model container [2020-08-27 21:53:13,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:53:13" (3/3) ... [2020-08-27 21:53:13,389 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label56.c [2020-08-27 21:53:13,401 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:53:13,415 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:53:13,438 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:53:13,474 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:53:13,474 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:53:13,474 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:53:13,475 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:53:13,475 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:53:13,475 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:53:13,475 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:53:13,475 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:53:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-27 21:53:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-27 21:53:13,514 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:13,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:13,516 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -503641322, now seen corresponding path program 1 times [2020-08-27 21:53:13,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:13,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954212464] [2020-08-27 21:53:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:14,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:53:14,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954212464] [2020-08-27 21:53:14,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:53:14,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-27 21:53:14,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234662637] [2020-08-27 21:53:14,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:53:14,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:53:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:53:14,255 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-27 21:53:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:16,629 INFO L93 Difference]: Finished difference Result 698 states and 1233 transitions. [2020-08-27 21:53:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:53:16,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-08-27 21:53:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:16,657 INFO L225 Difference]: With dead ends: 698 [2020-08-27 21:53:16,657 INFO L226 Difference]: Without dead ends: 423 [2020-08-27 21:53:16,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-08-27 21:53:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2020-08-27 21:53:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-08-27 21:53:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 603 transitions. [2020-08-27 21:53:16,806 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 603 transitions. Word has length 82 [2020-08-27 21:53:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:16,807 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 603 transitions. [2020-08-27 21:53:16,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:53:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 603 transitions. [2020-08-27 21:53:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-08-27 21:53:16,814 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:16,814 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-27 21:53:16,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:53:16,815 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 613251555, now seen corresponding path program 1 times [2020-08-27 21:53:16,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:16,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120091978] [2020-08-27 21:53:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:16,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:17,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:53:17,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120091978] [2020-08-27 21:53:17,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:17,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-27 21:53:17,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006571580] [2020-08-27 21:53:17,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:53:17,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:53:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:53:17,054 INFO L87 Difference]: Start difference. First operand 417 states and 603 transitions. Second operand 5 states. [2020-08-27 21:53:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:18,384 INFO L93 Difference]: Finished difference Result 1245 states and 1837 transitions. [2020-08-27 21:53:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:53:18,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-08-27 21:53:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:18,392 INFO L225 Difference]: With dead ends: 1245 [2020-08-27 21:53:18,392 INFO L226 Difference]: Without dead ends: 834 [2020-08-27 21:53:18,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:53:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-08-27 21:53:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 693. [2020-08-27 21:53:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-08-27 21:53:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 960 transitions. [2020-08-27 21:53:18,442 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 960 transitions. Word has length 99 [2020-08-27 21:53:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:18,443 INFO L479 AbstractCegarLoop]: Abstraction has 693 states and 960 transitions. [2020-08-27 21:53:18,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:53:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 960 transitions. [2020-08-27 21:53:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-27 21:53:18,448 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:18,448 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:18,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:53:18,449 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1223806666, now seen corresponding path program 1 times [2020-08-27 21:53:18,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:18,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [857817834] [2020-08-27 21:53:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:18,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:18,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:18,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:53:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:53:18,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [857817834] [2020-08-27 21:53:18,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:18,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:18,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605712751] [2020-08-27 21:53:18,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:18,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:18,737 INFO L87 Difference]: Start difference. First operand 693 states and 960 transitions. Second operand 7 states. [2020-08-27 21:53:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:20,348 INFO L93 Difference]: Finished difference Result 1690 states and 2417 transitions. [2020-08-27 21:53:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:53:20,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-08-27 21:53:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:20,357 INFO L225 Difference]: With dead ends: 1690 [2020-08-27 21:53:20,357 INFO L226 Difference]: Without dead ends: 1003 [2020-08-27 21:53:20,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:53:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2020-08-27 21:53:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 838. [2020-08-27 21:53:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-08-27 21:53:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1143 transitions. [2020-08-27 21:53:20,413 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1143 transitions. Word has length 136 [2020-08-27 21:53:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:20,414 INFO L479 AbstractCegarLoop]: Abstraction has 838 states and 1143 transitions. [2020-08-27 21:53:20,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1143 transitions. [2020-08-27 21:53:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-27 21:53:20,420 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:20,420 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:20,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:53:20,421 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1817929918, now seen corresponding path program 1 times [2020-08-27 21:53:20,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:20,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041200351] [2020-08-27 21:53:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:20,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:20,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:20,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:53:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-27 21:53:20,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041200351] [2020-08-27 21:53:20,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:20,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:53:20,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782477554] [2020-08-27 21:53:20,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:53:20,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:53:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:53:20,758 INFO L87 Difference]: Start difference. First operand 838 states and 1143 transitions. Second operand 8 states. [2020-08-27 21:53:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:22,354 INFO L93 Difference]: Finished difference Result 2260 states and 3152 transitions. [2020-08-27 21:53:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:22,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2020-08-27 21:53:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:22,367 INFO L225 Difference]: With dead ends: 2260 [2020-08-27 21:53:22,367 INFO L226 Difference]: Without dead ends: 1428 [2020-08-27 21:53:22,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:53:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-08-27 21:53:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1281. [2020-08-27 21:53:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2020-08-27 21:53:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1678 transitions. [2020-08-27 21:53:22,438 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1678 transitions. Word has length 140 [2020-08-27 21:53:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:22,438 INFO L479 AbstractCegarLoop]: Abstraction has 1281 states and 1678 transitions. [2020-08-27 21:53:22,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:53:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1678 transitions. [2020-08-27 21:53:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-08-27 21:53:22,448 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:22,448 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:22,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:53:22,449 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash -623709673, now seen corresponding path program 1 times [2020-08-27 21:53:22,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:22,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072901331] [2020-08-27 21:53:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:22,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:22,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:22,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:53:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:22,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-27 21:53:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-27 21:53:22,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072901331] [2020-08-27 21:53:22,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:22,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:22,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21271898] [2020-08-27 21:53:22,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:22,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:22,702 INFO L87 Difference]: Start difference. First operand 1281 states and 1678 transitions. Second operand 7 states. [2020-08-27 21:53:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:24,124 INFO L93 Difference]: Finished difference Result 2584 states and 3414 transitions. [2020-08-27 21:53:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:24,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2020-08-27 21:53:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:24,133 INFO L225 Difference]: With dead ends: 2584 [2020-08-27 21:53:24,134 INFO L226 Difference]: Without dead ends: 1309 [2020-08-27 21:53:24,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:53:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2020-08-27 21:53:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1152. [2020-08-27 21:53:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2020-08-27 21:53:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1510 transitions. [2020-08-27 21:53:24,183 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1510 transitions. Word has length 151 [2020-08-27 21:53:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:24,184 INFO L479 AbstractCegarLoop]: Abstraction has 1152 states and 1510 transitions. [2020-08-27 21:53:24,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1510 transitions. [2020-08-27 21:53:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-08-27 21:53:24,189 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:24,189 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:53:24,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:53:24,189 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash 752268368, now seen corresponding path program 1 times [2020-08-27 21:53:24,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:24,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1280758019] [2020-08-27 21:53:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:24,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:24,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:24,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-27 21:53:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:24,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-27 21:53:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:24,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-27 21:53:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 93 proven. 37 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-08-27 21:53:24,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1280758019] [2020-08-27 21:53:24,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:24,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:24,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856595878] [2020-08-27 21:53:24,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:24,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:24,469 INFO L87 Difference]: Start difference. First operand 1152 states and 1510 transitions. Second operand 7 states. [2020-08-27 21:53:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:25,908 INFO L93 Difference]: Finished difference Result 3047 states and 4152 transitions. [2020-08-27 21:53:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:53:25,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2020-08-27 21:53:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:25,922 INFO L225 Difference]: With dead ends: 3047 [2020-08-27 21:53:25,922 INFO L226 Difference]: Without dead ends: 1901 [2020-08-27 21:53:25,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:53:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2020-08-27 21:53:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1873. [2020-08-27 21:53:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2020-08-27 21:53:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2413 transitions. [2020-08-27 21:53:26,007 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2413 transitions. Word has length 174 [2020-08-27 21:53:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:26,007 INFO L479 AbstractCegarLoop]: Abstraction has 1873 states and 2413 transitions. [2020-08-27 21:53:26,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2413 transitions. [2020-08-27 21:53:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-08-27 21:53:26,014 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:26,014 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-08-27 21:53:26,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:53:26,015 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash 300051243, now seen corresponding path program 1 times [2020-08-27 21:53:26,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:26,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [109081673] [2020-08-27 21:53:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:26,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:26,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:26,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-27 21:53:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:26,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-27 21:53:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 98 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-08-27 21:53:26,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [109081673] [2020-08-27 21:53:26,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:26,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:26,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353179516] [2020-08-27 21:53:26,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:26,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:26,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:26,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:26,392 INFO L87 Difference]: Start difference. First operand 1873 states and 2413 transitions. Second operand 7 states. [2020-08-27 21:53:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:28,236 INFO L93 Difference]: Finished difference Result 4296 states and 5621 transitions. [2020-08-27 21:53:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:28,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2020-08-27 21:53:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:28,249 INFO L225 Difference]: With dead ends: 4296 [2020-08-27 21:53:28,250 INFO L226 Difference]: Without dead ends: 2564 [2020-08-27 21:53:28,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:53:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2020-08-27 21:53:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2562. [2020-08-27 21:53:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-08-27 21:53:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3212 transitions. [2020-08-27 21:53:28,330 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3212 transitions. Word has length 173 [2020-08-27 21:53:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:28,330 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 3212 transitions. [2020-08-27 21:53:28,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3212 transitions. [2020-08-27 21:53:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-08-27 21:53:28,338 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:28,338 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2020-08-27 21:53:28,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:53:28,338 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1578325538, now seen corresponding path program 1 times [2020-08-27 21:53:28,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:28,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2119971789] [2020-08-27 21:53:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:28,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:28,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:28,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-27 21:53:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:28,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-27 21:53:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:28,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-27 21:53:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-08-27 21:53:28,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2119971789] [2020-08-27 21:53:28,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:28,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:28,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286867537] [2020-08-27 21:53:28,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:28,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:28,600 INFO L87 Difference]: Start difference. First operand 2562 states and 3212 transitions. Second operand 7 states. [2020-08-27 21:53:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:30,269 INFO L93 Difference]: Finished difference Result 5402 states and 6847 transitions. [2020-08-27 21:53:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:53:30,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-08-27 21:53:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:30,285 INFO L225 Difference]: With dead ends: 5402 [2020-08-27 21:53:30,285 INFO L226 Difference]: Without dead ends: 2981 [2020-08-27 21:53:30,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:53:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-08-27 21:53:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2977. [2020-08-27 21:53:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2020-08-27 21:53:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 3718 transitions. [2020-08-27 21:53:30,368 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 3718 transitions. Word has length 210 [2020-08-27 21:53:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:30,368 INFO L479 AbstractCegarLoop]: Abstraction has 2977 states and 3718 transitions. [2020-08-27 21:53:30,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 3718 transitions. [2020-08-27 21:53:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-08-27 21:53:30,377 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:30,377 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2020-08-27 21:53:30,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:53:30,378 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash 765637946, now seen corresponding path program 1 times [2020-08-27 21:53:30,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:30,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334881261] [2020-08-27 21:53:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:30,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:30,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:30,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-27 21:53:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:30,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-27 21:53:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:30,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-27 21:53:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 165 proven. 57 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-08-27 21:53:30,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334881261] [2020-08-27 21:53:30,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:30,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:53:30,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646161085] [2020-08-27 21:53:30,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:53:30,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:53:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:53:30,750 INFO L87 Difference]: Start difference. First operand 2977 states and 3718 transitions. Second operand 9 states. [2020-08-27 21:53:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:34,884 INFO L93 Difference]: Finished difference Result 7305 states and 9384 transitions. [2020-08-27 21:53:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-27 21:53:34,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2020-08-27 21:53:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:34,906 INFO L225 Difference]: With dead ends: 7305 [2020-08-27 21:53:34,906 INFO L226 Difference]: Without dead ends: 4469 [2020-08-27 21:53:34,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:53:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2020-08-27 21:53:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4459. [2020-08-27 21:53:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4459 states. [2020-08-27 21:53:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 5645 transitions. [2020-08-27 21:53:35,049 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 5645 transitions. Word has length 224 [2020-08-27 21:53:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:35,050 INFO L479 AbstractCegarLoop]: Abstraction has 4459 states and 5645 transitions. [2020-08-27 21:53:35,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:53:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 5645 transitions. [2020-08-27 21:53:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-27 21:53:35,069 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:35,070 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-08-27 21:53:35,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:53:35,070 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash -443844938, now seen corresponding path program 1 times [2020-08-27 21:53:35,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:35,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21286668] [2020-08-27 21:53:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:35,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:35,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:35,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-27 21:53:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:35,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-08-27 21:53:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:35,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-08-27 21:53:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 189 proven. 27 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-27 21:53:35,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21286668] [2020-08-27 21:53:35,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:35,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:53:35,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720265631] [2020-08-27 21:53:35,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:53:35,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:53:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:53:35,624 INFO L87 Difference]: Start difference. First operand 4459 states and 5645 transitions. Second operand 10 states. [2020-08-27 21:53:36,653 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-08-27 21:53:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:39,060 INFO L93 Difference]: Finished difference Result 8586 states and 10611 transitions. [2020-08-27 21:53:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-27 21:53:39,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2020-08-27 21:53:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:39,077 INFO L225 Difference]: With dead ends: 8586 [2020-08-27 21:53:39,078 INFO L226 Difference]: Without dead ends: 4268 [2020-08-27 21:53:39,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:53:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2020-08-27 21:53:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4119. [2020-08-27 21:53:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2020-08-27 21:53:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 4860 transitions. [2020-08-27 21:53:39,191 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 4860 transitions. Word has length 254 [2020-08-27 21:53:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:39,191 INFO L479 AbstractCegarLoop]: Abstraction has 4119 states and 4860 transitions. [2020-08-27 21:53:39,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:53:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 4860 transitions. [2020-08-27 21:53:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-08-27 21:53:39,204 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:39,205 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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] [2020-08-27 21:53:39,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:53:39,205 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 377203419, now seen corresponding path program 1 times [2020-08-27 21:53:39,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:39,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [41357046] [2020-08-27 21:53:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-27 21:53:39,296 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-27 21:53:39,296 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-27 21:53:39,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:53:39,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:53:39 BoogieIcfgContainer [2020-08-27 21:53:39,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:53:39,350 INFO L168 Benchmark]: Toolchain (without parser) took 28229.48 ms. Allocated memory was 147.8 MB in the beginning and 522.7 MB in the end (delta: 374.9 MB). Free memory was 102.6 MB in the beginning and 300.5 MB in the end (delta: -197.9 MB). Peak memory consumption was 176.9 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:39,351 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 147.8 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-27 21:53:39,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.00 ms. Allocated memory was 147.8 MB in the beginning and 206.6 MB in the end (delta: 58.7 MB). Free memory was 102.4 MB in the beginning and 172.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:39,353 INFO L168 Benchmark]: Boogie Preprocessor took 134.76 ms. Allocated memory is still 206.6 MB. Free memory was 172.4 MB in the beginning and 167.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:39,354 INFO L168 Benchmark]: RCFGBuilder took 1342.06 ms. Allocated memory was 206.6 MB in the beginning and 238.0 MB in the end (delta: 31.5 MB). Free memory was 167.5 MB in the beginning and 179.3 MB in the end (delta: -11.9 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:39,354 INFO L168 Benchmark]: TraceAbstraction took 25968.56 ms. Allocated memory was 238.0 MB in the beginning and 522.7 MB in the end (delta: 284.7 MB). Free memory was 179.3 MB in the beginning and 300.5 MB in the end (delta: -121.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:39,358 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.25 ms. Allocated memory is still 147.8 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.00 ms. Allocated memory was 147.8 MB in the beginning and 206.6 MB in the end (delta: 58.7 MB). Free memory was 102.4 MB in the beginning and 172.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.76 ms. Allocated memory is still 206.6 MB. Free memory was 172.4 MB in the beginning and 167.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1342.06 ms. Allocated memory was 206.6 MB in the beginning and 238.0 MB in the end (delta: 31.5 MB). Free memory was 167.5 MB in the beginning and 179.3 MB in the end (delta: -11.9 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25968.56 ms. Allocated memory was 238.0 MB in the beginning and 522.7 MB in the end (delta: 284.7 MB). Free memory was 179.3 MB in the beginning and 300.5 MB in the end (delta: -121.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 404]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L224] a21 = 1 [L225] a8 = 14 [L226] a16 = 4 [L227] a20 = 0 [L228] a7 = 0 [L229] a17 = 0 [L230] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L404] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.8s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 319 SDtfs, 5640 SDslu, 522 SDs, 0 SdLazy, 10822 SolverSat, 1906 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4459occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 809 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1910 NumberOfCodeBlocks, 1910 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1633 ConstructedInterpolants, 0 QuantifiedInterpolants, 683973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 1194/1410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...