java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 22:40:59,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 22:40:59,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 22:40:59,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 22:40:59,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 22:40:59,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 22:40:59,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 22:40:59,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 22:40:59,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 22:40:59,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 22:40:59,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 22:40:59,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 22:40:59,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 22:40:59,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 22:40:59,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 22:40:59,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 22:40:59,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 22:40:59,801 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 22:40:59,803 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 22:40:59,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 22:40:59,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 22:40:59,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 22:40:59,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 22:40:59,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 22:40:59,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 22:40:59,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 22:40:59,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 22:40:59,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 22:40:59,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 22:40:59,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 22:40:59,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 22:40:59,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 22:40:59,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 22:40:59,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 22:40:59,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 22:40:59,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 22:40:59,818 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 22:40:59,838 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 22:40:59,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 22:40:59,839 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 22:40:59,840 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 22:40:59,840 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 22:40:59,840 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 22:40:59,840 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 22:40:59,840 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 22:40:59,841 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 22:40:59,841 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 22:40:59,841 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 22:40:59,841 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 22:40:59,841 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 22:40:59,842 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 22:40:59,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 22:40:59,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 22:40:59,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 22:40:59,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 22:40:59,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 22:40:59,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 22:40:59,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 22:40:59,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 22:40:59,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 22:40:59,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 22:40:59,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 22:40:59,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 22:40:59,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 22:40:59,845 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 22:40:59,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 22:40:59,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 22:40:59,847 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 22:40:59,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 22:40:59,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 22:40:59,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 22:40:59,848 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 22:40:59,848 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 22:40:59,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 22:40:59,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 22:40:59,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 22:40:59,945 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 22:40:59,946 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 22:40:59,946 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-10-24 22:41:00,012 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/743b58e5d/1f15f07c653e4dc4a5537bfb38ae1a8d/FLAG97b0f8ba2 [2018-10-24 22:41:00,606 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 22:41:00,607 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-10-24 22:41:00,622 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/743b58e5d/1f15f07c653e4dc4a5537bfb38ae1a8d/FLAG97b0f8ba2 [2018-10-24 22:41:00,644 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/743b58e5d/1f15f07c653e4dc4a5537bfb38ae1a8d [2018-10-24 22:41:00,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 22:41:00,659 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 22:41:00,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 22:41:00,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 22:41:00,665 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 22:41:00,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:00" (1/1) ... [2018-10-24 22:41:00,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b349afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:00, skipping insertion in model container [2018-10-24 22:41:00,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:00" (1/1) ... [2018-10-24 22:41:00,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 22:41:00,753 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 22:41:01,301 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:41:01,311 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 22:41:01,429 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:41:01,450 INFO L193 MainTranslator]: Completed translation [2018-10-24 22:41:01,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01 WrapperNode [2018-10-24 22:41:01,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 22:41:01,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 22:41:01,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 22:41:01,452 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 22:41:01,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 22:41:01,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 22:41:01,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 22:41:01,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 22:41:01,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... [2018-10-24 22:41:01,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 22:41:01,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 22:41:01,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 22:41:01,718 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 22:41:01,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 22:41:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 22:41:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 22:41:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 22:41:01,796 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 22:41:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 22:41:01,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 22:41:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 22:41:01,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 22:41:05,070 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 22:41:05,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:05 BoogieIcfgContainer [2018-10-24 22:41:05,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 22:41:05,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 22:41:05,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 22:41:05,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 22:41:05,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:41:00" (1/3) ... [2018-10-24 22:41:05,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15724634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:05, skipping insertion in model container [2018-10-24 22:41:05,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:01" (2/3) ... [2018-10-24 22:41:05,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15724634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:05, skipping insertion in model container [2018-10-24 22:41:05,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:05" (3/3) ... [2018-10-24 22:41:05,085 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label50_false-unreach-call_false-termination.c [2018-10-24 22:41:05,095 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 22:41:05,106 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 22:41:05,124 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 22:41:05,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 22:41:05,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 22:41:05,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 22:41:05,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 22:41:05,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 22:41:05,164 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 22:41:05,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 22:41:05,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 22:41:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-24 22:41:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 22:41:05,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:05,203 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:05,206 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:05,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash -110615784, now seen corresponding path program 1 times [2018-10-24 22:41:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:05,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:05,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:05,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:05,859 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 22:41:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:41:06,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:41:06,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:41:06,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:06,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:41:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:41:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:41:06,028 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-24 22:41:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:07,913 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-24 22:41:07,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:41:07,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-10-24 22:41:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:07,936 INFO L225 Difference]: With dead ends: 621 [2018-10-24 22:41:07,936 INFO L226 Difference]: Without dead ends: 382 [2018-10-24 22:41:07,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:41:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-24 22:41:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-24 22:41:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-24 22:41:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-24 22:41:08,021 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 88 [2018-10-24 22:41:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:08,022 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-24 22:41:08,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:41:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-24 22:41:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-24 22:41:08,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:08,028 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:08,029 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:08,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2087174949, now seen corresponding path program 1 times [2018-10-24 22:41:08,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:08,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:08,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:08,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:08,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:41:08,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:41:08,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:41:08,262 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:08,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:41:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:41:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:41:08,265 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 3 states. [2018-10-24 22:41:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:09,395 INFO L93 Difference]: Finished difference Result 1057 states and 1749 transitions. [2018-10-24 22:41:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:41:09,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-24 22:41:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:09,406 INFO L225 Difference]: With dead ends: 1057 [2018-10-24 22:41:09,406 INFO L226 Difference]: Without dead ends: 681 [2018-10-24 22:41:09,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:41:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-10-24 22:41:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 676. [2018-10-24 22:41:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-10-24 22:41:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1044 transitions. [2018-10-24 22:41:09,476 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1044 transitions. Word has length 97 [2018-10-24 22:41:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:09,477 INFO L481 AbstractCegarLoop]: Abstraction has 676 states and 1044 transitions. [2018-10-24 22:41:09,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:41:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1044 transitions. [2018-10-24 22:41:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 22:41:09,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:09,483 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:09,483 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:09,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1316217369, now seen corresponding path program 1 times [2018-10-24 22:41:09,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:09,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:09,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:41:10,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:41:10,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 22:41:10,012 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:10,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:41:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:41:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:41:10,014 INFO L87 Difference]: Start difference. First operand 676 states and 1044 transitions. Second operand 6 states. [2018-10-24 22:41:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:12,643 INFO L93 Difference]: Finished difference Result 2173 states and 3497 transitions. [2018-10-24 22:41:12,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:41:12,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-24 22:41:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:12,702 INFO L225 Difference]: With dead ends: 2173 [2018-10-24 22:41:12,702 INFO L226 Difference]: Without dead ends: 1503 [2018-10-24 22:41:12,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-24 22:41:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2018-10-24 22:41:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1483. [2018-10-24 22:41:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2018-10-24 22:41:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2166 transitions. [2018-10-24 22:41:12,782 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2166 transitions. Word has length 103 [2018-10-24 22:41:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:12,783 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 2166 transitions. [2018-10-24 22:41:12,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:41:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2166 transitions. [2018-10-24 22:41:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-24 22:41:12,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:12,788 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:12,788 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:12,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash -654069662, now seen corresponding path program 1 times [2018-10-24 22:41:12,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:12,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:12,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:41:12,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:41:12,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 22:41:12,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:12,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:41:12,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:41:12,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:41:12,944 INFO L87 Difference]: Start difference. First operand 1483 states and 2166 transitions. Second operand 6 states. [2018-10-24 22:41:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:14,591 INFO L93 Difference]: Finished difference Result 4036 states and 5989 transitions. [2018-10-24 22:41:14,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:41:14,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-10-24 22:41:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:14,610 INFO L225 Difference]: With dead ends: 4036 [2018-10-24 22:41:14,610 INFO L226 Difference]: Without dead ends: 2559 [2018-10-24 22:41:14,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 22:41:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2018-10-24 22:41:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2527. [2018-10-24 22:41:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-10-24 22:41:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3541 transitions. [2018-10-24 22:41:14,697 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3541 transitions. Word has length 111 [2018-10-24 22:41:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:14,697 INFO L481 AbstractCegarLoop]: Abstraction has 2527 states and 3541 transitions. [2018-10-24 22:41:14,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:41:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3541 transitions. [2018-10-24 22:41:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-24 22:41:14,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:14,704 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:14,704 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:14,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1207925353, now seen corresponding path program 1 times [2018-10-24 22:41:14,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:14,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:14,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 22:41:15,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:15,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:15,165 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-10-24 22:41:15,167 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [375], [377], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 22:41:15,243 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:15,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:16,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:16,711 INFO L272 AbstractInterpreter]: Visited 93 different actions 274 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-24 22:41:16,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:16,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:16,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:16,762 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:41:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:16,778 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:16,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-24 22:41:17,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:41:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-24 22:41:17,270 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:41:17,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-10-24 22:41:17,271 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:17,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:41:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:41:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:41:17,272 INFO L87 Difference]: Start difference. First operand 2527 states and 3541 transitions. Second operand 3 states. [2018-10-24 22:41:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:18,763 INFO L93 Difference]: Finished difference Result 6709 states and 9644 transitions. [2018-10-24 22:41:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:41:18,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-10-24 22:41:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:18,775 INFO L225 Difference]: With dead ends: 6709 [2018-10-24 22:41:18,776 INFO L226 Difference]: Without dead ends: 1763 [2018-10-24 22:41:18,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 251 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:41:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2018-10-24 22:41:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1735. [2018-10-24 22:41:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-10-24 22:41:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2266 transitions. [2018-10-24 22:41:18,853 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2266 transitions. Word has length 125 [2018-10-24 22:41:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:18,854 INFO L481 AbstractCegarLoop]: Abstraction has 1735 states and 2266 transitions. [2018-10-24 22:41:18,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:41:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2266 transitions. [2018-10-24 22:41:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-24 22:41:18,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:18,859 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 22:41:18,860 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:18,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash 775673070, now seen corresponding path program 1 times [2018-10-24 22:41:18,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:18,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-24 22:41:19,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:19,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:19,062 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-10-24 22:41:19,062 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [29], [30], [34], [38], [42], [53], [64], [68], [72], [76], [79], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [375], [377], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 22:41:19,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:19,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:19,282 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:41:19,282 INFO L272 AbstractInterpreter]: Visited 90 different actions 90 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-24 22:41:19,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:19,324 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:41:19,734 INFO L232 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 80.41% of their original sizes. [2018-10-24 22:41:19,734 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:41:19,992 INFO L413 sIntCurrentIteration]: We have 135 unified AI predicates [2018-10-24 22:41:19,992 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:41:19,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:41:19,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 22:41:19,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:20,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:41:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:41:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:41:20,001 INFO L87 Difference]: Start difference. First operand 1735 states and 2266 transitions. Second operand 6 states. [2018-10-24 22:41:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:27,044 INFO L93 Difference]: Finished difference Result 3614 states and 4713 transitions. [2018-10-24 22:41:27,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:41:27,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-24 22:41:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:27,054 INFO L225 Difference]: With dead ends: 3614 [2018-10-24 22:41:27,054 INFO L226 Difference]: Without dead ends: 1885 [2018-10-24 22:41:27,059 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:41:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2018-10-24 22:41:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1882. [2018-10-24 22:41:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2018-10-24 22:41:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2424 transitions. [2018-10-24 22:41:27,102 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2424 transitions. Word has length 136 [2018-10-24 22:41:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:27,102 INFO L481 AbstractCegarLoop]: Abstraction has 1882 states and 2424 transitions. [2018-10-24 22:41:27,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:41:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2424 transitions. [2018-10-24 22:41:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-24 22:41:27,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:27,108 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:27,108 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:27,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash 795873743, now seen corresponding path program 1 times [2018-10-24 22:41:27,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:27,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 57 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 22:41:28,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:28,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:28,109 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-10-24 22:41:28,110 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [29], [30], [34], [38], [42], [53], [64], [68], [72], [76], [79], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [375], [377], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 22:41:28,114 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:28,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:28,537 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:41:28,538 INFO L272 AbstractInterpreter]: Visited 94 different actions 279 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-24 22:41:28,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:28,572 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:41:29,630 INFO L232 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 80.95% of their original sizes. [2018-10-24 22:41:29,631 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:41:32,823 INFO L413 sIntCurrentIteration]: We have 145 unified AI predicates [2018-10-24 22:41:32,823 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:41:32,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:41:32,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-24 22:41:32,824 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:32,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:41:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:41:32,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-24 22:41:32,826 INFO L87 Difference]: Start difference. First operand 1882 states and 2424 transitions. Second operand 12 states. [2018-10-24 22:41:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:47,565 INFO L93 Difference]: Finished difference Result 4863 states and 6180 transitions. [2018-10-24 22:41:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 22:41:47,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2018-10-24 22:41:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:47,582 INFO L225 Difference]: With dead ends: 4863 [2018-10-24 22:41:47,582 INFO L226 Difference]: Without dead ends: 2987 [2018-10-24 22:41:47,588 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 40 SyntacticMatches, 95 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-24 22:41:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2018-10-24 22:41:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2837. [2018-10-24 22:41:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2018-10-24 22:41:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 3555 transitions. [2018-10-24 22:41:47,665 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 3555 transitions. Word has length 146 [2018-10-24 22:41:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:47,666 INFO L481 AbstractCegarLoop]: Abstraction has 2837 states and 3555 transitions. [2018-10-24 22:41:47,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:41:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 3555 transitions. [2018-10-24 22:41:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-24 22:41:47,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:47,672 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 22:41:47,673 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:47,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2044541068, now seen corresponding path program 1 times [2018-10-24 22:41:47,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:47,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:47,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:47,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:47,675 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 22:41:48,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:48,260 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:48,260 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-10-24 22:41:48,260 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [29], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [375], [377], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 22:41:48,264 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:48,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:48,398 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:41:48,398 INFO L272 AbstractInterpreter]: Visited 93 different actions 180 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-24 22:41:48,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:48,406 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:41:48,678 INFO L232 lantSequenceWeakener]: Weakened 147 states. On average, predicates are now at 80.49% of their original sizes. [2018-10-24 22:41:48,679 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:41:49,170 INFO L413 sIntCurrentIteration]: We have 149 unified AI predicates [2018-10-24 22:41:49,171 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:41:49,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:41:49,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-10-24 22:41:49,172 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:49,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 22:41:49,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 22:41:49,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:41:49,173 INFO L87 Difference]: Start difference. First operand 2837 states and 3555 transitions. Second operand 10 states. [2018-10-24 22:41:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:54,683 INFO L93 Difference]: Finished difference Result 6122 states and 7690 transitions. [2018-10-24 22:41:54,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 22:41:54,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2018-10-24 22:41:54,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:54,698 INFO L225 Difference]: With dead ends: 6122 [2018-10-24 22:41:54,698 INFO L226 Difference]: Without dead ends: 3435 [2018-10-24 22:41:54,705 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-24 22:41:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2018-10-24 22:41:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3429. [2018-10-24 22:41:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3429 states. [2018-10-24 22:41:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4224 transitions. [2018-10-24 22:41:54,794 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4224 transitions. Word has length 150 [2018-10-24 22:41:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:54,794 INFO L481 AbstractCegarLoop]: Abstraction has 3429 states and 4224 transitions. [2018-10-24 22:41:54,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 22:41:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4224 transitions. [2018-10-24 22:41:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-24 22:41:54,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:54,802 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:54,802 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:54,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1278379132, now seen corresponding path program 1 times [2018-10-24 22:41:54,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:54,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:54,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:54,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:54,804 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 63 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 22:41:55,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:55,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:55,013 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-10-24 22:41:55,013 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [29], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [375], [377], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 22:41:55,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:55,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:55,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:55,437 INFO L272 AbstractInterpreter]: Visited 94 different actions 369 times. Merged at 8 different actions 29 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-24 22:41:55,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:55,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:55,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:55,445 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:41:55,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:55,453 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:55,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 22:41:55,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:41:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 22:41:55,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:41:55,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-10-24 22:41:55,751 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:41:55,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 22:41:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 22:41:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:41:55,753 INFO L87 Difference]: Start difference. First operand 3429 states and 4224 transitions. Second operand 13 states. [2018-10-24 22:41:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:58,226 INFO L93 Difference]: Finished difference Result 6247 states and 8021 transitions. [2018-10-24 22:41:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 22:41:58,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2018-10-24 22:41:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:58,243 INFO L225 Difference]: With dead ends: 6247 [2018-10-24 22:41:58,243 INFO L226 Difference]: Without dead ends: 3568 [2018-10-24 22:41:58,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 22:41:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3568 states. [2018-10-24 22:41:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3568 to 3249. [2018-10-24 22:41:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2018-10-24 22:41:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 3824 transitions. [2018-10-24 22:41:58,576 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 3824 transitions. Word has length 154 [2018-10-24 22:41:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:58,577 INFO L481 AbstractCegarLoop]: Abstraction has 3249 states and 3824 transitions. [2018-10-24 22:41:58,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 22:41:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 3824 transitions. [2018-10-24 22:41:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-24 22:41:58,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:58,587 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:58,587 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:58,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1099268731, now seen corresponding path program 1 times [2018-10-24 22:41:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:58,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:58,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:58,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:59,026 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-24 22:41:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 110 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:41:59,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:59,313 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:59,313 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-10-24 22:41:59,313 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [29], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [375], [377], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 22:41:59,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:59,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:59,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:59,768 INFO L272 AbstractInterpreter]: Visited 94 different actions 371 times. Merged at 8 different actions 31 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-24 22:41:59,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:59,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:59,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:59,775 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:41:59,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:59,785 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:59,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:42:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-24 22:42:00,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:42:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-24 22:42:00,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:42:00,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-10-24 22:42:00,498 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:42:00,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 22:42:00,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 22:42:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-10-24 22:42:00,500 INFO L87 Difference]: Start difference. First operand 3249 states and 3824 transitions. Second operand 17 states. [2018-10-24 22:42:01,888 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-10-24 22:42:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:42:07,304 INFO L93 Difference]: Finished difference Result 8364 states and 9990 transitions. [2018-10-24 22:42:07,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-24 22:42:07,304 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 198 [2018-10-24 22:42:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:42:07,328 INFO L225 Difference]: With dead ends: 8364 [2018-10-24 22:42:07,328 INFO L226 Difference]: Without dead ends: 5805 [2018-10-24 22:42:07,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 428 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=858, Invalid=2924, Unknown=0, NotChecked=0, Total=3782 [2018-10-24 22:42:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2018-10-24 22:42:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 5403. [2018-10-24 22:42:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5403 states. [2018-10-24 22:42:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 6272 transitions. [2018-10-24 22:42:07,516 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 6272 transitions. Word has length 198 [2018-10-24 22:42:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:42:07,517 INFO L481 AbstractCegarLoop]: Abstraction has 5403 states and 6272 transitions. [2018-10-24 22:42:07,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 22:42:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 6272 transitions. [2018-10-24 22:42:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 22:42:07,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:42:07,534 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:42:07,534 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:42:07,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:42:07,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1424222514, now seen corresponding path program 1 times [2018-10-24 22:42:07,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:42:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:07,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:42:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:07,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:42:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:42:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 22:42:07,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:42:07,953 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:42:07,953 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-10-24 22:42:07,954 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [29], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [375], [377], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 22:42:07,957 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:42:07,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:42:08,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:42:08,733 INFO L272 AbstractInterpreter]: Visited 95 different actions 389 times. Merged at 9 different actions 45 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 5 different actions. Largest state had 38 variables. [2018-10-24 22:42:08,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:42:08,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:42:08,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:42:08,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:42:08,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:42:08,749 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:42:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:42:08,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:42:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 22:42:09,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:42:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 22:42:09,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:42:09,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-24 22:42:09,272 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:42:09,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 22:42:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 22:42:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:42:09,273 INFO L87 Difference]: Start difference. First operand 5403 states and 6272 transitions. Second operand 9 states. [2018-10-24 22:42:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:42:12,241 INFO L93 Difference]: Finished difference Result 11616 states and 14544 transitions. [2018-10-24 22:42:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 22:42:12,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2018-10-24 22:42:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:42:12,269 INFO L225 Difference]: With dead ends: 11616 [2018-10-24 22:42:12,269 INFO L226 Difference]: Without dead ends: 3800 [2018-10-24 22:42:12,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-10-24 22:42:12,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2018-10-24 22:42:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3723. [2018-10-24 22:42:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3723 states. [2018-10-24 22:42:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 4284 transitions. [2018-10-24 22:42:12,423 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 4284 transitions. Word has length 216 [2018-10-24 22:42:12,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:42:12,423 INFO L481 AbstractCegarLoop]: Abstraction has 3723 states and 4284 transitions. [2018-10-24 22:42:12,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 22:42:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 4284 transitions. [2018-10-24 22:42:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 22:42:12,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:42:12,431 INFO L375 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:42:12,432 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:42:12,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:42:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash 298332797, now seen corresponding path program 1 times [2018-10-24 22:42:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:42:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:12,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:42:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:12,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:42:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 22:42:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 22:42:12,578 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 22:42:12,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:42:12 BoogieIcfgContainer [2018-10-24 22:42:12,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 22:42:12,759 INFO L168 Benchmark]: Toolchain (without parser) took 72101.44 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 806.7 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:12,760 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 22:42:12,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:12,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 189.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:12,762 INFO L168 Benchmark]: Boogie Preprocessor took 76.11 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 22:42:12,763 INFO L168 Benchmark]: RCFGBuilder took 3353.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:12,764 INFO L168 Benchmark]: TraceAbstraction took 67682.29 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -605.3 MB). Peak memory consumption was 751.5 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:12,768 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 189.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.11 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3353.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67682.29 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -605.3 MB). Peak memory consumption was 751.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; VAL [\old(a)=24, \old(a11)=27, \old(a17)=14, \old(a19)=15, \old(a21)=18, \old(a25)=20, \old(a28)=28, \old(c)=16, \old(d)=22, \old(e)=13, \old(f)=21, \old(u)=25, \old(v)=12, \old(w)=23, \old(x)=17, \old(y)=26, \old(z)=19, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] RET return 23; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, calculate_output(input)=23, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] RET return 25; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, calculate_output(input)=25, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] RET return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=1, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] __VERIFIER_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. UNSAFE Result, 67.5s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 48.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1697 SDtfs, 10310 SDslu, 1385 SDs, 0 SdLazy, 14692 SolverSat, 2426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2036 GetRequests, 1758 SyntacticMatches, 109 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5403occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 7 AbstIntIterations, 3 AbstIntStrong, 0.9956937192231318 AbsIntWeakeningRatio, 0.2867132867132867 AbsIntAvgWeakeningVarsNumRemoved, 8.685314685314685 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2450 NumberOfCodeBlocks, 2450 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2891 ConstructedInterpolants, 0 QuantifiedInterpolants, 1224152 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1884 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 1658/1872 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...