/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-177f698 [2020-08-21 13:21:30,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 13:21:30,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 13:21:30,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 13:21:30,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 13:21:30,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 13:21:30,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 13:21:30,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 13:21:30,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 13:21:30,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 13:21:30,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 13:21:30,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 13:21:30,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 13:21:30,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 13:21:30,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 13:21:30,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 13:21:30,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 13:21:30,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 13:21:30,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 13:21:30,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 13:21:30,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 13:21:30,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 13:21:30,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 13:21:30,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 13:21:30,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 13:21:30,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 13:21:30,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 13:21:30,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 13:21:30,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 13:21:30,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 13:21:30,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 13:21:30,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 13:21:30,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 13:21:30,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 13:21:30,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 13:21:30,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 13:21:30,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 13:21:30,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 13:21:30,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 13:21:30,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 13:21:30,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 13:21:30,664 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-21 13:21:30,699 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 13:21:30,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 13:21:30,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 13:21:30,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 13:21:30,701 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 13:21:30,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 13:21:30,702 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 13:21:30,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 13:21:30,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 13:21:30,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 13:21:30,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 13:21:30,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 13:21:30,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 13:21:30,703 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 13:21:30,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 13:21:30,704 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 13:21:30,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 13:21:30,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 13:21:30,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 13:21:30,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 13:21:30,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 13:21:30,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 13:21:30,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 13:21:30,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 13:21:30,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 13:21:30,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 13:21:30,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 13:21:30,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 13:21:30,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 13:21:30,706 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-21 13:21:31,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 13:21:31,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 13:21:31,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 13:21:31,025 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 13:21:31,026 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 13:21:31,026 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-21 13:21:31,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a43972937/7a165c34af704b9d8095f68ea1028d8a/FLAGe9bf14c9c [2020-08-21 13:21:31,733 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 13:21:31,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label56.c [2020-08-21 13:21:31,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a43972937/7a165c34af704b9d8095f68ea1028d8a/FLAGe9bf14c9c [2020-08-21 13:21:31,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a43972937/7a165c34af704b9d8095f68ea1028d8a [2020-08-21 13:21:31,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 13:21:31,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 13:21:32,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 13:21:32,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 13:21:32,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 13:21:32,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:21:31" (1/1) ... [2020-08-21 13:21:32,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b55177b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32, skipping insertion in model container [2020-08-21 13:21:32,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:21:31" (1/1) ... [2020-08-21 13:21:32,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 13:21:32,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 13:21:32,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:21:32,590 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 13:21:32,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:21:32,756 INFO L208 MainTranslator]: Completed translation [2020-08-21 13:21:32,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32 WrapperNode [2020-08-21 13:21:32,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 13:21:32,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 13:21:32,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 13:21:32,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 13:21:32,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (1/1) ... [2020-08-21 13:21:32,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (1/1) ... [2020-08-21 13:21:32,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (1/1) ... [2020-08-21 13:21:32,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (1/1) ... [2020-08-21 13:21:32,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (1/1) ... [2020-08-21 13:21:32,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (1/1) ... [2020-08-21 13:21:32,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (1/1) ... [2020-08-21 13:21:32,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 13:21:32,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 13:21:32,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 13:21:32,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 13:21:32,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (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-21 13:21:32,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 13:21:32,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 13:21:32,998 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-21 13:21:32,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 13:21:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-21 13:21:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 13:21:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 13:21:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-21 13:21:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 13:21:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 13:21:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 13:21:34,320 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 13:21:34,320 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-21 13:21:34,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:21:34 BoogieIcfgContainer [2020-08-21 13:21:34,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 13:21:34,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 13:21:34,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 13:21:34,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 13:21:34,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 01:21:31" (1/3) ... [2020-08-21 13:21:34,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfd15b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:21:34, skipping insertion in model container [2020-08-21 13:21:34,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:21:32" (2/3) ... [2020-08-21 13:21:34,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfd15b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:21:34, skipping insertion in model container [2020-08-21 13:21:34,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:21:34" (3/3) ... [2020-08-21 13:21:34,343 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label56.c [2020-08-21 13:21:34,354 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 13:21:34,366 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 13:21:34,382 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 13:21:34,418 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 13:21:34,419 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 13:21:34,419 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 13:21:34,420 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 13:21:34,420 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 13:21:34,420 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 13:21:34,420 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 13:21:34,420 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 13:21:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-21 13:21:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-21 13:21:34,465 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:34,467 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-21 13:21:34,467 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:34,475 INFO L82 PathProgramCache]: Analyzing trace with hash -503641322, now seen corresponding path program 1 times [2020-08-21 13:21:34,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:34,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [991375780] [2020-08-21 13:21:34,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:35,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:35,182 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-21 13:21:35,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [991375780] [2020-08-21 13:21:35,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:21:35,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-21 13:21:35,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569106550] [2020-08-21 13:21:35,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:21:35,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:21:35,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:21:35,209 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-21 13:21:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:37,616 INFO L93 Difference]: Finished difference Result 698 states and 1233 transitions. [2020-08-21 13:21:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 13:21:37,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-08-21 13:21:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:37,637 INFO L225 Difference]: With dead ends: 698 [2020-08-21 13:21:37,637 INFO L226 Difference]: Without dead ends: 423 [2020-08-21 13:21:37,646 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-21 13:21:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-08-21 13:21:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2020-08-21 13:21:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-08-21 13:21:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 603 transitions. [2020-08-21 13:21:37,734 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 603 transitions. Word has length 82 [2020-08-21 13:21:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:37,735 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 603 transitions. [2020-08-21 13:21:37,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:21:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 603 transitions. [2020-08-21 13:21:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-08-21 13:21:37,742 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:37,743 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-21 13:21:37,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 13:21:37,743 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash 613251555, now seen corresponding path program 1 times [2020-08-21 13:21:37,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:37,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811954930] [2020-08-21 13:21:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:37,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:38,018 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-21 13:21:38,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811954930] [2020-08-21 13:21:38,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:38,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-21 13:21:38,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761220062] [2020-08-21 13:21:38,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 13:21:38,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:38,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 13:21:38,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:21:38,023 INFO L87 Difference]: Start difference. First operand 417 states and 603 transitions. Second operand 5 states. [2020-08-21 13:21:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:39,111 INFO L93 Difference]: Finished difference Result 1245 states and 1837 transitions. [2020-08-21 13:21:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 13:21:39,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-08-21 13:21:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:39,120 INFO L225 Difference]: With dead ends: 1245 [2020-08-21 13:21:39,121 INFO L226 Difference]: Without dead ends: 834 [2020-08-21 13:21:39,125 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-21 13:21:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-08-21 13:21:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 693. [2020-08-21 13:21:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-08-21 13:21:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 960 transitions. [2020-08-21 13:21:39,178 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 960 transitions. Word has length 99 [2020-08-21 13:21:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:39,179 INFO L479 AbstractCegarLoop]: Abstraction has 693 states and 960 transitions. [2020-08-21 13:21:39,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 13:21:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 960 transitions. [2020-08-21 13:21:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-21 13:21:39,189 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:39,189 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-21 13:21:39,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 13:21:39,190 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:39,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1223806666, now seen corresponding path program 1 times [2020-08-21 13:21:39,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:39,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795772157] [2020-08-21 13:21:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:39,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:39,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:39,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 13:21:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:39,424 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-21 13:21:39,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [795772157] [2020-08-21 13:21:39,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:39,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:39,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951759074] [2020-08-21 13:21:39,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:39,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:39,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:39,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:39,428 INFO L87 Difference]: Start difference. First operand 693 states and 960 transitions. Second operand 7 states. [2020-08-21 13:21:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:40,723 INFO L93 Difference]: Finished difference Result 1690 states and 2417 transitions. [2020-08-21 13:21:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 13:21:40,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-08-21 13:21:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:40,731 INFO L225 Difference]: With dead ends: 1690 [2020-08-21 13:21:40,731 INFO L226 Difference]: Without dead ends: 1003 [2020-08-21 13:21:40,734 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-21 13:21:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2020-08-21 13:21:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 838. [2020-08-21 13:21:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-08-21 13:21:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1143 transitions. [2020-08-21 13:21:40,784 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1143 transitions. Word has length 136 [2020-08-21 13:21:40,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:40,785 INFO L479 AbstractCegarLoop]: Abstraction has 838 states and 1143 transitions. [2020-08-21 13:21:40,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1143 transitions. [2020-08-21 13:21:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-21 13:21:40,793 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:40,794 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-21 13:21:40,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 13:21:40,794 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1817929918, now seen corresponding path program 1 times [2020-08-21 13:21:40,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:40,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1084032122] [2020-08-21 13:21:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:40,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 13:21:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:41,072 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-21 13:21:41,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1084032122] [2020-08-21 13:21:41,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:41,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 13:21:41,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143335027] [2020-08-21 13:21:41,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 13:21:41,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:41,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 13:21:41,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-21 13:21:41,076 INFO L87 Difference]: Start difference. First operand 838 states and 1143 transitions. Second operand 8 states. [2020-08-21 13:21:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:42,354 INFO L93 Difference]: Finished difference Result 2260 states and 3152 transitions. [2020-08-21 13:21:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:21:42,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2020-08-21 13:21:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:42,367 INFO L225 Difference]: With dead ends: 2260 [2020-08-21 13:21:42,367 INFO L226 Difference]: Without dead ends: 1428 [2020-08-21 13:21:42,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-21 13:21:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-08-21 13:21:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1281. [2020-08-21 13:21:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2020-08-21 13:21:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1678 transitions. [2020-08-21 13:21:42,435 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1678 transitions. Word has length 140 [2020-08-21 13:21:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:42,436 INFO L479 AbstractCegarLoop]: Abstraction has 1281 states and 1678 transitions. [2020-08-21 13:21:42,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 13:21:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1678 transitions. [2020-08-21 13:21:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-08-21 13:21:42,443 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:42,443 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-21 13:21:42,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 13:21:42,444 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -623709673, now seen corresponding path program 1 times [2020-08-21 13:21:42,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:42,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1020589001] [2020-08-21 13:21:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:42,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:42,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:42,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 13:21:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:42,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-21 13:21:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:42,700 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-21 13:21:42,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1020589001] [2020-08-21 13:21:42,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:42,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:42,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375539792] [2020-08-21 13:21:42,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:42,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:42,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:42,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:42,703 INFO L87 Difference]: Start difference. First operand 1281 states and 1678 transitions. Second operand 7 states. [2020-08-21 13:21:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:43,945 INFO L93 Difference]: Finished difference Result 2584 states and 3414 transitions. [2020-08-21 13:21:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:21:43,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2020-08-21 13:21:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:43,953 INFO L225 Difference]: With dead ends: 2584 [2020-08-21 13:21:43,953 INFO L226 Difference]: Without dead ends: 1309 [2020-08-21 13:21:43,956 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-21 13:21:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2020-08-21 13:21:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1152. [2020-08-21 13:21:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2020-08-21 13:21:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1510 transitions. [2020-08-21 13:21:43,995 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1510 transitions. Word has length 151 [2020-08-21 13:21:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:43,996 INFO L479 AbstractCegarLoop]: Abstraction has 1152 states and 1510 transitions. [2020-08-21 13:21:43,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1510 transitions. [2020-08-21 13:21:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-08-21 13:21:44,001 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:44,001 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-21 13:21:44,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 13:21:44,002 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:44,002 INFO L82 PathProgramCache]: Analyzing trace with hash 752268368, now seen corresponding path program 1 times [2020-08-21 13:21:44,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:44,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1833627131] [2020-08-21 13:21:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:44,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:44,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:44,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-21 13:21:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:44,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-21 13:21:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:44,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-21 13:21:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:44,213 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-21 13:21:44,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1833627131] [2020-08-21 13:21:44,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:44,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:44,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585431577] [2020-08-21 13:21:44,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:44,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:44,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:44,217 INFO L87 Difference]: Start difference. First operand 1152 states and 1510 transitions. Second operand 7 states. [2020-08-21 13:21:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:45,888 INFO L93 Difference]: Finished difference Result 3047 states and 4152 transitions. [2020-08-21 13:21:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 13:21:45,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2020-08-21 13:21:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:45,904 INFO L225 Difference]: With dead ends: 3047 [2020-08-21 13:21:45,904 INFO L226 Difference]: Without dead ends: 1901 [2020-08-21 13:21:45,909 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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-21 13:21:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2020-08-21 13:21:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1873. [2020-08-21 13:21:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2020-08-21 13:21:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2413 transitions. [2020-08-21 13:21:45,979 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2413 transitions. Word has length 174 [2020-08-21 13:21:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:45,980 INFO L479 AbstractCegarLoop]: Abstraction has 1873 states and 2413 transitions. [2020-08-21 13:21:45,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2413 transitions. [2020-08-21 13:21:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-08-21 13:21:45,987 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:45,988 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-21 13:21:45,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 13:21:45,988 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:45,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:45,989 INFO L82 PathProgramCache]: Analyzing trace with hash 300051243, now seen corresponding path program 1 times [2020-08-21 13:21:45,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:45,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913637049] [2020-08-21 13:21:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:46,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:46,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:46,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-21 13:21:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:46,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-21 13:21:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:46,281 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-21 13:21:46,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913637049] [2020-08-21 13:21:46,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:46,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:46,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386960896] [2020-08-21 13:21:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:46,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:46,285 INFO L87 Difference]: Start difference. First operand 1873 states and 2413 transitions. Second operand 7 states. [2020-08-21 13:21:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:47,726 INFO L93 Difference]: Finished difference Result 4296 states and 5621 transitions. [2020-08-21 13:21:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 13:21:47,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2020-08-21 13:21:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:47,742 INFO L225 Difference]: With dead ends: 4296 [2020-08-21 13:21:47,743 INFO L226 Difference]: Without dead ends: 2564 [2020-08-21 13:21:47,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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-21 13:21:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2020-08-21 13:21:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2562. [2020-08-21 13:21:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-08-21 13:21:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3212 transitions. [2020-08-21 13:21:47,854 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3212 transitions. Word has length 173 [2020-08-21 13:21:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:47,855 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 3212 transitions. [2020-08-21 13:21:47,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3212 transitions. [2020-08-21 13:21:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-08-21 13:21:47,863 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:47,864 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-21 13:21:47,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 13:21:47,864 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1578325538, now seen corresponding path program 1 times [2020-08-21 13:21:47,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:47,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [694261366] [2020-08-21 13:21:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:47,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:47,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:48,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-21 13:21:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:48,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-21 13:21:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:48,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-21 13:21:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:48,130 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-21 13:21:48,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [694261366] [2020-08-21 13:21:48,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:48,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:21:48,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919229860] [2020-08-21 13:21:48,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:21:48,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:21:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:21:48,133 INFO L87 Difference]: Start difference. First operand 2562 states and 3212 transitions. Second operand 7 states. [2020-08-21 13:21:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:49,684 INFO L93 Difference]: Finished difference Result 5402 states and 6847 transitions. [2020-08-21 13:21:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 13:21:49,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-08-21 13:21:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:49,699 INFO L225 Difference]: With dead ends: 5402 [2020-08-21 13:21:49,700 INFO L226 Difference]: Without dead ends: 2981 [2020-08-21 13:21:49,705 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-21 13:21:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-08-21 13:21:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2977. [2020-08-21 13:21:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2020-08-21 13:21:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 3718 transitions. [2020-08-21 13:21:49,784 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 3718 transitions. Word has length 210 [2020-08-21 13:21:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:49,787 INFO L479 AbstractCegarLoop]: Abstraction has 2977 states and 3718 transitions. [2020-08-21 13:21:49,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:21:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 3718 transitions. [2020-08-21 13:21:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-08-21 13:21:49,798 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:49,798 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-21 13:21:49,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 13:21:49,799 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash 765637946, now seen corresponding path program 1 times [2020-08-21 13:21:49,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:49,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [559513800] [2020-08-21 13:21:49,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:49,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:49,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:49,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-21 13:21:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:50,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-21 13:21:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:50,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-21 13:21:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:50,083 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-21 13:21:50,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [559513800] [2020-08-21 13:21:50,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:50,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 13:21:50,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759487514] [2020-08-21 13:21:50,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 13:21:50,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 13:21:50,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-21 13:21:50,086 INFO L87 Difference]: Start difference. First operand 2977 states and 3718 transitions. Second operand 9 states. [2020-08-21 13:21:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:53,826 INFO L93 Difference]: Finished difference Result 7305 states and 9384 transitions. [2020-08-21 13:21:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-21 13:21:53,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2020-08-21 13:21:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:53,847 INFO L225 Difference]: With dead ends: 7305 [2020-08-21 13:21:53,847 INFO L226 Difference]: Without dead ends: 4469 [2020-08-21 13:21:53,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-08-21 13:21:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2020-08-21 13:21:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4459. [2020-08-21 13:21:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4459 states. [2020-08-21 13:21:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 5645 transitions. [2020-08-21 13:21:53,998 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 5645 transitions. Word has length 224 [2020-08-21 13:21:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:53,998 INFO L479 AbstractCegarLoop]: Abstraction has 4459 states and 5645 transitions. [2020-08-21 13:21:53,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 13:21:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 5645 transitions. [2020-08-21 13:21:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-21 13:21:54,016 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:54,017 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-21 13:21:54,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 13:21:54,017 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash -443844938, now seen corresponding path program 1 times [2020-08-21 13:21:54,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:54,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355131045] [2020-08-21 13:21:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:54,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:21:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:54,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:21:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:54,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-21 13:21:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:54,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-08-21 13:21:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:54,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-08-21 13:21:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:21:54,421 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-21 13:21:54,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355131045] [2020-08-21 13:21:54,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:21:54,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 13:21:54,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203010340] [2020-08-21 13:21:54,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 13:21:54,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:21:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 13:21:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-08-21 13:21:54,424 INFO L87 Difference]: Start difference. First operand 4459 states and 5645 transitions. Second operand 10 states. [2020-08-21 13:21:55,275 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-08-21 13:21:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:21:57,262 INFO L93 Difference]: Finished difference Result 8586 states and 10611 transitions. [2020-08-21 13:21:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 13:21:57,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2020-08-21 13:21:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:21:57,279 INFO L225 Difference]: With dead ends: 8586 [2020-08-21 13:21:57,280 INFO L226 Difference]: Without dead ends: 4268 [2020-08-21 13:21:57,294 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2020-08-21 13:21:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2020-08-21 13:21:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4119. [2020-08-21 13:21:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2020-08-21 13:21:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 4860 transitions. [2020-08-21 13:21:57,448 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 4860 transitions. Word has length 254 [2020-08-21 13:21:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:21:57,449 INFO L479 AbstractCegarLoop]: Abstraction has 4119 states and 4860 transitions. [2020-08-21 13:21:57,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 13:21:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 4860 transitions. [2020-08-21 13:21:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-08-21 13:21:57,465 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:21:57,466 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-21 13:21:57,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 13:21:57,466 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:21:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:21:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash 377203419, now seen corresponding path program 1 times [2020-08-21 13:21:57,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:21:57,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1977156267] [2020-08-21 13:21:57,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:21:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 13:21:57,549 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 13:21:57,550 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 13:21:57,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 13:21:57,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 01:21:57 BoogieIcfgContainer [2020-08-21 13:21:57,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 13:21:57,637 INFO L168 Benchmark]: Toolchain (without parser) took 25636.90 ms. Allocated memory was 140.5 MB in the beginning and 552.6 MB in the end (delta: 412.1 MB). Free memory was 101.2 MB in the beginning and 454.9 MB in the end (delta: -353.7 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:57,638 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-21 13:21:57,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.52 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 169.2 MB in the end (delta: -68.2 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:57,644 INFO L168 Benchmark]: Boogie Preprocessor took 150.66 ms. Allocated memory is still 205.5 MB. Free memory was 169.2 MB in the beginning and 164.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:57,645 INFO L168 Benchmark]: RCFGBuilder took 1421.78 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 164.4 MB in the beginning and 177.2 MB in the end (delta: -12.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:57,647 INFO L168 Benchmark]: TraceAbstraction took 23300.42 ms. Allocated memory was 238.0 MB in the beginning and 552.6 MB in the end (delta: 314.6 MB). Free memory was 175.8 MB in the beginning and 454.9 MB in the end (delta: -279.2 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2020-08-21 13:21:57,658 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.13 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.52 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 169.2 MB in the end (delta: -68.2 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 150.66 ms. Allocated memory is still 205.5 MB. Free memory was 169.2 MB in the beginning and 164.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1421.78 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 164.4 MB in the beginning and 177.2 MB in the end (delta: -12.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23300.42 ms. Allocated memory was 238.0 MB in the beginning and 552.6 MB in the end (delta: 314.6 MB). Free memory was 175.8 MB in the beginning and 454.9 MB in the end (delta: -279.2 MB). Peak memory consumption was 35.4 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: 23.1s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 18.8s, 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, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.4s 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.5s SatisfiabilityAnalysisTime, 2.1s 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...