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/Problem01_label20_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 22:39:29,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 22:39:29,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 22:39:30,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 22:39:30,001 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 22:39:30,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 22:39:30,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 22:39:30,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 22:39:30,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 22:39:30,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 22:39:30,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 22:39:30,009 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 22:39:30,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 22:39:30,011 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 22:39:30,012 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 22:39:30,013 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 22:39:30,014 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 22:39:30,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 22:39:30,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 22:39:30,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 22:39:30,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 22:39:30,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 22:39:30,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 22:39:30,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 22:39:30,025 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 22:39:30,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 22:39:30,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 22:39:30,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 22:39:30,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 22:39:30,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 22:39:30,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 22:39:30,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 22:39:30,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 22:39:30,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 22:39:30,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 22:39:30,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 22:39:30,034 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:39:30,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 22:39:30,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 22:39:30,066 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 22:39:30,066 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 22:39:30,066 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 22:39:30,066 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 22:39:30,067 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 22:39:30,068 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 22:39:30,068 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 22:39:30,068 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 22:39:30,069 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 22:39:30,069 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 22:39:30,069 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 22:39:30,069 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 22:39:30,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 22:39:30,070 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 22:39:30,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 22:39:30,071 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 22:39:30,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 22:39:30,071 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 22:39:30,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 22:39:30,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 22:39:30,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 22:39:30,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 22:39:30,074 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 22:39:30,074 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 22:39:30,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 22:39:30,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 22:39:30,075 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 22:39:30,075 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 22:39:30,075 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 22:39:30,076 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 22:39:30,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 22:39:30,076 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 22:39:30,076 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 22:39:30,076 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 22:39:30,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 22:39:30,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 22:39:30,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 22:39:30,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 22:39:30,178 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 22:39:30,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-10-24 22:39:30,249 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f2b9a04c/2d0018e28f414dfe86520b1fd5a7dd07/FLAG3b4c69ad9 [2018-10-24 22:39:30,865 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 22:39:30,866 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-10-24 22:39:30,879 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f2b9a04c/2d0018e28f414dfe86520b1fd5a7dd07/FLAG3b4c69ad9 [2018-10-24 22:39:30,895 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f2b9a04c/2d0018e28f414dfe86520b1fd5a7dd07 [2018-10-24 22:39:30,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 22:39:30,909 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 22:39:30,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 22:39:30,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 22:39:30,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 22:39:30,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:30" (1/1) ... [2018-10-24 22:39:30,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b98b391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:30, skipping insertion in model container [2018-10-24 22:39:30,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:30" (1/1) ... [2018-10-24 22:39:30,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 22:39:30,990 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 22:39:31,417 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:39:31,422 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 22:39:31,552 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:39:31,578 INFO L193 MainTranslator]: Completed translation [2018-10-24 22:39:31,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31 WrapperNode [2018-10-24 22:39:31,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 22:39:31,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 22:39:31,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 22:39:31,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 22:39:31,592 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:39:31" (1/1) ... [2018-10-24 22:39:31,625 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:39:31" (1/1) ... [2018-10-24 22:39:31,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 22:39:31,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 22:39:31,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 22:39:31,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 22:39:31,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 22:39:31,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 22:39:31,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 22:39:31,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 22:39:31,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (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:39:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 22:39:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 22:39:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 22:39:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 22:39:31,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 22:39:31,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 22:39:31,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 22:39:31,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 22:39:35,330 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 22:39:35,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:35 BoogieIcfgContainer [2018-10-24 22:39:35,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 22:39:35,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 22:39:35,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 22:39:35,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 22:39:35,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:39:30" (1/3) ... [2018-10-24 22:39:35,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ed34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:35, skipping insertion in model container [2018-10-24 22:39:35,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31" (2/3) ... [2018-10-24 22:39:35,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ed34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:35, skipping insertion in model container [2018-10-24 22:39:35,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:35" (3/3) ... [2018-10-24 22:39:35,347 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label20_false-unreach-call_false-termination.c [2018-10-24 22:39:35,358 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 22:39:35,367 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 22:39:35,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 22:39:35,428 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 22:39:35,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 22:39:35,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 22:39:35,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 22:39:35,429 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 22:39:35,430 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 22:39:35,430 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 22:39:35,430 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 22:39:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-24 22:39:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 22:39:35,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:35,479 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] [2018-10-24 22:39:35,481 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:35,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1836367149, now seen corresponding path program 1 times [2018-10-24 22:39:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:35,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:35,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:35,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:35,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:36,141 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 22:39:36,323 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:39:36,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:36,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:39:36,327 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:36,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:39:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:39:36,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:39:36,352 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-24 22:39:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:38,848 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-24 22:39:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:39:38,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-10-24 22:39:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:38,869 INFO L225 Difference]: With dead ends: 550 [2018-10-24 22:39:38,869 INFO L226 Difference]: Without dead ends: 340 [2018-10-24 22:39:38,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:39:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-24 22:39:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-24 22:39:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-24 22:39:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-24 22:39:38,961 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 79 [2018-10-24 22:39:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:38,962 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-24 22:39:38,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:39:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-24 22:39:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-24 22:39:38,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:38,968 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 22:39:38,968 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:38,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1539527022, now seen corresponding path program 1 times [2018-10-24 22:39:38,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:38,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:38,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:38,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:39,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:39,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 22:39:39,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:39,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:39:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:39:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:39:39,160 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-24 22:39:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:40,964 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-24 22:39:40,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:39:40,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-10-24 22:39:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:40,971 INFO L225 Difference]: With dead ends: 888 [2018-10-24 22:39:40,972 INFO L226 Difference]: Without dead ends: 554 [2018-10-24 22:39:40,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 22:39:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-24 22:39:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-24 22:39:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-24 22:39:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-24 22:39:41,034 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 90 [2018-10-24 22:39:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:41,034 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-24 22:39:41,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:39:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-24 22:39:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-24 22:39:41,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:41,043 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 22:39:41,043 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:41,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1217877146, now seen corresponding path program 1 times [2018-10-24 22:39:41,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:41,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:41,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:41,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:41,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:39:41,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:41,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:39:41,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:39:41,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:39:41,222 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-10-24 22:39:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:42,475 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-10-24 22:39:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:39:42,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-10-24 22:39:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:42,488 INFO L225 Difference]: With dead ends: 1530 [2018-10-24 22:39:42,488 INFO L226 Difference]: Without dead ends: 997 [2018-10-24 22:39:42,492 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:39:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-10-24 22:39:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-10-24 22:39:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-10-24 22:39:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-10-24 22:39:42,535 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 91 [2018-10-24 22:39:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:42,535 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-10-24 22:39:42,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:39:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-10-24 22:39:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-24 22:39:42,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:42,551 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 22:39:42,552 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:42,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1260901286, now seen corresponding path program 1 times [2018-10-24 22:39:42,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:42,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:42,554 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:42,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:42,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:39:42,728 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:42,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:39:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:39:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:39:42,730 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-10-24 22:39:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:44,779 INFO L93 Difference]: Finished difference Result 2877 states and 4284 transitions. [2018-10-24 22:39:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:39:44,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-24 22:39:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:44,800 INFO L225 Difference]: With dead ends: 2877 [2018-10-24 22:39:44,800 INFO L226 Difference]: Without dead ends: 1886 [2018-10-24 22:39:44,806 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:39:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-10-24 22:39:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2018-10-24 22:39:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-10-24 22:39:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2689 transitions. [2018-10-24 22:39:44,887 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2689 transitions. Word has length 97 [2018-10-24 22:39:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:44,888 INFO L481 AbstractCegarLoop]: Abstraction has 1886 states and 2689 transitions. [2018-10-24 22:39:44,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:39:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2689 transitions. [2018-10-24 22:39:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-24 22:39:44,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:44,895 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:44,896 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:44,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1827829834, now seen corresponding path program 1 times [2018-10-24 22:39:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:44,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:44,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:45,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:45,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 22:39:45,066 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:45,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:39:45,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:39:45,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:39:45,068 INFO L87 Difference]: Start difference. First operand 1886 states and 2689 transitions. Second operand 6 states. [2018-10-24 22:39:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:46,196 INFO L93 Difference]: Finished difference Result 3816 states and 5597 transitions. [2018-10-24 22:39:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:39:46,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-10-24 22:39:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:46,211 INFO L225 Difference]: With dead ends: 3816 [2018-10-24 22:39:46,211 INFO L226 Difference]: Without dead ends: 1936 [2018-10-24 22:39:46,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 22:39:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-10-24 22:39:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1885. [2018-10-24 22:39:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-10-24 22:39:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2473 transitions. [2018-10-24 22:39:46,283 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2473 transitions. Word has length 105 [2018-10-24 22:39:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:46,284 INFO L481 AbstractCegarLoop]: Abstraction has 1885 states and 2473 transitions. [2018-10-24 22:39:46,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:39:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2473 transitions. [2018-10-24 22:39:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-24 22:39:46,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:46,290 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:46,290 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:46,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 982006726, now seen corresponding path program 1 times [2018-10-24 22:39:46,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:46,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:46,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:46,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 22:39:46,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:46,559 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:39:46,563 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-10-24 22:39:46,566 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:39:46,609 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:39:46,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:39:47,168 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:39:47,173 INFO L272 AbstractInterpreter]: Visited 79 different actions 79 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-24 22:39:47,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:47,222 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:39:47,743 INFO L232 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 79.67% of their original sizes. [2018-10-24 22:39:47,743 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:39:48,004 INFO L413 sIntCurrentIteration]: We have 112 unified AI predicates [2018-10-24 22:39:48,004 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:39:48,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:39:48,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-24 22:39:48,006 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:48,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:39:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:39:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:39:48,007 INFO L87 Difference]: Start difference. First operand 1885 states and 2473 transitions. Second operand 6 states. [2018-10-24 22:39:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:57,191 INFO L93 Difference]: Finished difference Result 3902 states and 5115 transitions. [2018-10-24 22:39:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 22:39:57,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-10-24 22:39:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:57,203 INFO L225 Difference]: With dead ends: 3902 [2018-10-24 22:39:57,204 INFO L226 Difference]: Without dead ends: 2023 [2018-10-24 22:39:57,208 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 113 GetRequests, 108 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:39:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-10-24 22:39:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2021. [2018-10-24 22:39:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2018-10-24 22:39:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2619 transitions. [2018-10-24 22:39:57,278 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2619 transitions. Word has length 113 [2018-10-24 22:39:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:57,278 INFO L481 AbstractCegarLoop]: Abstraction has 2021 states and 2619 transitions. [2018-10-24 22:39:57,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:39:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2619 transitions. [2018-10-24 22:39:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 22:39:57,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:57,284 INFO L375 BasicCegarLoop]: trace histogram [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, 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:39:57,284 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:57,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash 368614065, now seen corresponding path program 1 times [2018-10-24 22:39:57,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:57,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:57,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:57,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:57,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:39:57,492 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-10-24 22:39:57,493 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:39:57,497 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:39:57,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:39:57,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:39:57,812 INFO L272 AbstractInterpreter]: Visited 83 different actions 160 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-24 22:39:57,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:57,848 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:39:58,278 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 79.84% of their original sizes. [2018-10-24 22:39:58,279 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:39:58,611 INFO L413 sIntCurrentIteration]: We have 114 unified AI predicates [2018-10-24 22:39:58,612 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:39:58,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:39:58,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-24 22:39:58,612 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:58,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 22:39:58,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 22:39:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:39:58,613 INFO L87 Difference]: Start difference. First operand 2021 states and 2619 transitions. Second operand 10 states. [2018-10-24 22:40:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:05,093 INFO L93 Difference]: Finished difference Result 4041 states and 5284 transitions. [2018-10-24 22:40:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 22:40:05,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-24 22:40:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:05,103 INFO L225 Difference]: With dead ends: 4041 [2018-10-24 22:40:05,103 INFO L226 Difference]: Without dead ends: 2162 [2018-10-24 22:40:05,108 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 122 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-24 22:40:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2018-10-24 22:40:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2159. [2018-10-24 22:40:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2018-10-24 22:40:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2773 transitions. [2018-10-24 22:40:05,160 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2773 transitions. Word has length 115 [2018-10-24 22:40:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:05,160 INFO L481 AbstractCegarLoop]: Abstraction has 2159 states and 2773 transitions. [2018-10-24 22:40:05,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 22:40:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2773 transitions. [2018-10-24 22:40:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-24 22:40:05,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:05,165 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:40:05,165 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:05,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 538280163, now seen corresponding path program 1 times [2018-10-24 22:40:05,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:05,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:40:05,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:05,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:05,412 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-10-24 22:40:05,412 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:05,416 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:05,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:05,648 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:40:05,648 INFO L272 AbstractInterpreter]: Visited 83 different actions 159 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-24 22:40:05,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:05,659 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:40:06,339 INFO L232 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 80.06% of their original sizes. [2018-10-24 22:40:06,339 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:40:09,278 INFO L413 sIntCurrentIteration]: We have 116 unified AI predicates [2018-10-24 22:40:09,279 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:40:09,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:40:09,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-24 22:40:09,280 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:40:09,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 22:40:09,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 22:40:09,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:40:09,281 INFO L87 Difference]: Start difference. First operand 2159 states and 2773 transitions. Second operand 15 states. [2018-10-24 22:40:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:22,229 INFO L93 Difference]: Finished difference Result 5528 states and 7151 transitions. [2018-10-24 22:40:22,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 22:40:22,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2018-10-24 22:40:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:22,242 INFO L225 Difference]: With dead ends: 5528 [2018-10-24 22:40:22,242 INFO L226 Difference]: Without dead ends: 2683 [2018-10-24 22:40:22,251 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 123 GetRequests, 18 SyntacticMatches, 85 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-24 22:40:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-10-24 22:40:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2669. [2018-10-24 22:40:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2018-10-24 22:40:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3224 transitions. [2018-10-24 22:40:22,315 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3224 transitions. Word has length 117 [2018-10-24 22:40:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:22,315 INFO L481 AbstractCegarLoop]: Abstraction has 2669 states and 3224 transitions. [2018-10-24 22:40:22,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 22:40:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3224 transitions. [2018-10-24 22:40:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 22:40:22,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:22,320 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:40:22,321 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:22,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1534428207, now seen corresponding path program 1 times [2018-10-24 22:40:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:22,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:22,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 22:40:22,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:22,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:22,537 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-10-24 22:40:22,538 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:22,541 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:22,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:22,973 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:40:22,973 INFO L272 AbstractInterpreter]: Visited 83 different actions 252 times. Merged at 7 different actions 25 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-24 22:40:22,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:22,980 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:40:23,918 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 82.5% of their original sizes. [2018-10-24 22:40:23,918 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:40:27,888 INFO L413 sIntCurrentIteration]: We have 154 unified AI predicates [2018-10-24 22:40:27,888 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:40:27,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:40:27,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-10-24 22:40:27,889 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:40:27,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 22:40:27,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 22:40:27,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-24 22:40:27,890 INFO L87 Difference]: Start difference. First operand 2669 states and 3224 transitions. Second operand 11 states. [2018-10-24 22:40:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:37,574 INFO L93 Difference]: Finished difference Result 6547 states and 8057 transitions. [2018-10-24 22:40:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 22:40:37,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 155 [2018-10-24 22:40:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:37,592 INFO L225 Difference]: With dead ends: 6547 [2018-10-24 22:40:37,592 INFO L226 Difference]: Without dead ends: 4158 [2018-10-24 22:40:37,601 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 22 SyntacticMatches, 123 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:40:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2018-10-24 22:40:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 4149. [2018-10-24 22:40:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2018-10-24 22:40:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 4941 transitions. [2018-10-24 22:40:37,713 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 4941 transitions. Word has length 155 [2018-10-24 22:40:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:37,714 INFO L481 AbstractCegarLoop]: Abstraction has 4149 states and 4941 transitions. [2018-10-24 22:40:37,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 22:40:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 4941 transitions. [2018-10-24 22:40:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-24 22:40:37,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:37,722 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 22:40:37,722 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:37,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:37,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1376473004, now seen corresponding path program 1 times [2018-10-24 22:40:37,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:37,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:37,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:37,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:37,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 22:40:38,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:38,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:38,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-10-24 22:40:38,147 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:38,151 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:38,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:38,404 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:40:38,405 INFO L272 AbstractInterpreter]: Visited 84 different actions 162 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-24 22:40:38,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:38,444 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:40:38,991 INFO L232 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 80.07% of their original sizes. [2018-10-24 22:40:38,991 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:40:42,481 INFO L413 sIntCurrentIteration]: We have 162 unified AI predicates [2018-10-24 22:40:42,481 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:40:42,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:40:42,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-24 22:40:42,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:40:42,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 22:40:42,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 22:40:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:40:42,483 INFO L87 Difference]: Start difference. First operand 4149 states and 4941 transitions. Second operand 15 states. [2018-10-24 22:40:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:51,062 INFO L93 Difference]: Finished difference Result 8434 states and 10052 transitions. [2018-10-24 22:40:51,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 22:40:51,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 163 [2018-10-24 22:40:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:51,080 INFO L225 Difference]: With dead ends: 8434 [2018-10-24 22:40:51,081 INFO L226 Difference]: Without dead ends: 5037 [2018-10-24 22:40:51,088 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 31 SyntacticMatches, 118 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-24 22:40:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5037 states. [2018-10-24 22:40:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5037 to 5029. [2018-10-24 22:40:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2018-10-24 22:40:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 5883 transitions. [2018-10-24 22:40:51,211 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 5883 transitions. Word has length 163 [2018-10-24 22:40:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:51,211 INFO L481 AbstractCegarLoop]: Abstraction has 5029 states and 5883 transitions. [2018-10-24 22:40:51,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 22:40:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 5883 transitions. [2018-10-24 22:40:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 22:40:51,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:51,220 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 22:40:51,220 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:51,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1517055121, now seen corresponding path program 1 times [2018-10-24 22:40:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:51,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:51,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 22:40:51,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:51,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:51,508 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-10-24 22:40:51,508 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:51,510 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:51,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:52,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:40:52,290 INFO L272 AbstractInterpreter]: Visited 86 different actions 349 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:40:52,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:52,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:40:52,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:52,298 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:40:52,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:52,307 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:40:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:52,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:40:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-24 22:40:52,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:40:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 22:40:53,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:40:53,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-24 22:40:53,573 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:40:53,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 22:40:53,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 22:40:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-24 22:40:53,574 INFO L87 Difference]: Start difference. First operand 5029 states and 5883 transitions. Second operand 11 states. [2018-10-24 22:40:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:56,676 INFO L93 Difference]: Finished difference Result 9896 states and 11777 transitions. [2018-10-24 22:40:56,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 22:40:56,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 172 [2018-10-24 22:40:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:56,710 INFO L225 Difference]: With dead ends: 9896 [2018-10-24 22:40:56,710 INFO L226 Difference]: Without dead ends: 6026 [2018-10-24 22:40:56,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-24 22:40:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2018-10-24 22:40:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 5965. [2018-10-24 22:40:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5965 states. [2018-10-24 22:40:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5965 states to 5965 states and 6903 transitions. [2018-10-24 22:40:56,921 INFO L78 Accepts]: Start accepts. Automaton has 5965 states and 6903 transitions. Word has length 172 [2018-10-24 22:40:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:56,921 INFO L481 AbstractCegarLoop]: Abstraction has 5965 states and 6903 transitions. [2018-10-24 22:40:56,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 22:40:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5965 states and 6903 transitions. [2018-10-24 22:40:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 22:40:56,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:56,932 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 22:40:56,932 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:56,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1355415521, now seen corresponding path program 2 times [2018-10-24 22:40:56,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:56,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:56,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 48 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 22:40:57,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:57,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:57,463 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 22:40:57,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 22:40:57,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:57,464 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:40:57,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 22:40:57,473 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 22:40:57,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 22:40:57,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 22:40:57,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:40:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-24 22:40:57,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:40:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-24 22:40:57,972 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:40:57,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-24 22:40:57,972 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:40:57,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:40:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:40:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:40:57,973 INFO L87 Difference]: Start difference. First operand 5965 states and 6903 transitions. Second operand 3 states. [2018-10-24 22:40:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:58,636 INFO L93 Difference]: Finished difference Result 11460 states and 13505 transitions. [2018-10-24 22:40:58,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:40:58,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-24 22:40:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:58,656 INFO L225 Difference]: With dead ends: 11460 [2018-10-24 22:40:58,657 INFO L226 Difference]: Without dead ends: 6942 [2018-10-24 22:40:58,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:40:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2018-10-24 22:40:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6917. [2018-10-24 22:40:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6917 states. [2018-10-24 22:40:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6917 states to 6917 states and 8010 transitions. [2018-10-24 22:40:58,825 INFO L78 Accepts]: Start accepts. Automaton has 6917 states and 8010 transitions. Word has length 172 [2018-10-24 22:40:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:58,826 INFO L481 AbstractCegarLoop]: Abstraction has 6917 states and 8010 transitions. [2018-10-24 22:40:58,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:40:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6917 states and 8010 transitions. [2018-10-24 22:40:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-24 22:40:58,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:58,840 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:40:58,840 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:58,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1289112317, now seen corresponding path program 1 times [2018-10-24 22:40:58,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:58,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 22:40:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:58,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 64 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 22:40:59,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:59,533 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:59,533 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-24 22:40:59,533 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:59,537 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:59,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:01,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:01,491 INFO L272 AbstractInterpreter]: Visited 86 different actions 348 times. Merged at 9 different actions 40 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:41:01,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:01,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:01,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:01,538 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:01,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:01,555 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:01,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-24 22:41:02,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:41:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 116 proven. 14 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-24 22:41:02,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:41:02,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-24 22:41:02,305 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:41:02,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:41:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:41:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:41:02,307 INFO L87 Difference]: Start difference. First operand 6917 states and 8010 transitions. Second operand 12 states. [2018-10-24 22:41:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:07,812 INFO L93 Difference]: Finished difference Result 19618 states and 24491 transitions. [2018-10-24 22:41:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-24 22:41:07,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2018-10-24 22:41:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:07,859 INFO L225 Difference]: With dead ends: 19618 [2018-10-24 22:41:07,859 INFO L226 Difference]: Without dead ends: 13118 [2018-10-24 22:41:07,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 22:41:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2018-10-24 22:41:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 12592. [2018-10-24 22:41:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12592 states. [2018-10-24 22:41:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12592 states to 12592 states and 15294 transitions. [2018-10-24 22:41:08,264 INFO L78 Accepts]: Start accepts. Automaton has 12592 states and 15294 transitions. Word has length 190 [2018-10-24 22:41:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:08,265 INFO L481 AbstractCegarLoop]: Abstraction has 12592 states and 15294 transitions. [2018-10-24 22:41:08,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:41:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 12592 states and 15294 transitions. [2018-10-24 22:41:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-24 22:41:08,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:08,292 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:08,293 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:08,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash -444689533, now seen corresponding path program 1 times [2018-10-24 22:41:08,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:08,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:08,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:08,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:08,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:08,871 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 22:41:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 132 proven. 65 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 22:41:08,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:08,974 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:08,974 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-10-24 22:41:08,974 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:41:08,976 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:08,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:09,346 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:41:09,346 INFO L272 AbstractInterpreter]: Visited 85 different actions 247 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-24 22:41:09,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:09,381 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:41:11,005 INFO L232 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 80.1% of their original sizes. [2018-10-24 22:41:11,005 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:41:15,278 INFO L413 sIntCurrentIteration]: We have 198 unified AI predicates [2018-10-24 22:41:15,279 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:41:15,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:41:15,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-24 22:41:15,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:15,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 22:41:15,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 22:41:15,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-24 22:41:15,280 INFO L87 Difference]: Start difference. First operand 12592 states and 15294 transitions. Second operand 13 states. [2018-10-24 22:41:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:31,870 INFO L93 Difference]: Finished difference Result 25174 states and 30673 transitions. [2018-10-24 22:41:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 22:41:31,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 199 [2018-10-24 22:41:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:31,926 INFO L225 Difference]: With dead ends: 25174 [2018-10-24 22:41:31,926 INFO L226 Difference]: Without dead ends: 13711 [2018-10-24 22:41:31,954 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 49 SyntacticMatches, 138 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-24 22:41:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13711 states. [2018-10-24 22:41:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13711 to 13702. [2018-10-24 22:41:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13702 states. [2018-10-24 22:41:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13702 states to 13702 states and 16496 transitions. [2018-10-24 22:41:32,334 INFO L78 Accepts]: Start accepts. Automaton has 13702 states and 16496 transitions. Word has length 199 [2018-10-24 22:41:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:32,335 INFO L481 AbstractCegarLoop]: Abstraction has 13702 states and 16496 transitions. [2018-10-24 22:41:32,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 22:41:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13702 states and 16496 transitions. [2018-10-24 22:41:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-24 22:41:32,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:32,370 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:32,371 INFO L424 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:32,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1458504401, now seen corresponding path program 1 times [2018-10-24 22:41:32,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:32,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:32,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:33,417 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 22:41:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 187 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 22:41:33,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:33,658 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:33,659 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-10-24 22:41:33,659 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:41:33,661 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:33,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:34,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:34,887 INFO L272 AbstractInterpreter]: Visited 86 different actions 344 times. Merged at 9 different actions 36 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:41:34,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:34,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:34,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:34,895 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:41:34,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:34,903 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:35,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-24 22:41:35,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:41:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-24 22:41:35,248 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:41:35,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-24 22:41:35,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:41:35,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:41:35,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:41:35,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:41:35,249 INFO L87 Difference]: Start difference. First operand 13702 states and 16496 transitions. Second operand 3 states. [2018-10-24 22:41:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:36,095 INFO L93 Difference]: Finished difference Result 28745 states and 35076 transitions. [2018-10-24 22:41:36,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:41:36,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-10-24 22:41:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:36,157 INFO L225 Difference]: With dead ends: 28745 [2018-10-24 22:41:36,157 INFO L226 Difference]: Without dead ends: 16874 [2018-10-24 22:41:36,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 428 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:41:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16874 states. [2018-10-24 22:41:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16874 to 16602. [2018-10-24 22:41:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16602 states. [2018-10-24 22:41:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16602 states to 16602 states and 19816 transitions. [2018-10-24 22:41:36,630 INFO L78 Accepts]: Start accepts. Automaton has 16602 states and 19816 transitions. Word has length 215 [2018-10-24 22:41:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:36,631 INFO L481 AbstractCegarLoop]: Abstraction has 16602 states and 19816 transitions. [2018-10-24 22:41:36,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:41:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 16602 states and 19816 transitions. [2018-10-24 22:41:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-24 22:41:36,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:36,666 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:41:36,667 INFO L424 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:36,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash 665445909, now seen corresponding path program 1 times [2018-10-24 22:41:36,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:36,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 189 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 22:41:37,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:37,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:37,492 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-10-24 22:41:37,492 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:41:37,494 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:37,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:38,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:38,334 INFO L272 AbstractInterpreter]: Visited 86 different actions 344 times. Merged at 9 different actions 36 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:41:38,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:38,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:38,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:38,346 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:41:38,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:38,355 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:38,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-24 22:41:38,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:41:39,105 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-10-24 22:41:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 169 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 22:41:39,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:41:39,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-24 22:41:39,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:41:39,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:41:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:41:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:41:39,552 INFO L87 Difference]: Start difference. First operand 16602 states and 19816 transitions. Second operand 12 states. [2018-10-24 22:41:41,750 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-24 22:41:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:44,552 INFO L93 Difference]: Finished difference Result 34478 states and 45299 transitions. [2018-10-24 22:41:44,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-24 22:41:44,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 217 [2018-10-24 22:41:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:44,626 INFO L225 Difference]: With dead ends: 34478 [2018-10-24 22:41:44,626 INFO L226 Difference]: Without dead ends: 16892 [2018-10-24 22:41:44,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=330, Invalid=1230, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 22:41:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16892 states. [2018-10-24 22:41:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16892 to 14739. [2018-10-24 22:41:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14739 states. [2018-10-24 22:41:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14739 states to 14739 states and 16901 transitions. [2018-10-24 22:41:45,174 INFO L78 Accepts]: Start accepts. Automaton has 14739 states and 16901 transitions. Word has length 217 [2018-10-24 22:41:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:45,174 INFO L481 AbstractCegarLoop]: Abstraction has 14739 states and 16901 transitions. [2018-10-24 22:41:45,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:41:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14739 states and 16901 transitions. [2018-10-24 22:41:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-24 22:41:45,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:45,201 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,201 INFO L424 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:45,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash -101145250, now seen corresponding path program 1 times [2018-10-24 22:41:45,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:45,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:45,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:45,203 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 232 proven. 78 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 22:41:45,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:45,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:45,611 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-10-24 22:41:45,612 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:41:45,614 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:45,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:46,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:46,468 INFO L272 AbstractInterpreter]: Visited 87 different actions 356 times. Merged at 10 different actions 44 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:41:46,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:46,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:46,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:46,475 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:41:46,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:46,484 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:46,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-24 22:41:47,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:41:47,575 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-10-24 22:41:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 207 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-10-24 22:41:48,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:41:48,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-24 22:41:48,057 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:41:48,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:41:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:41:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:41:48,058 INFO L87 Difference]: Start difference. First operand 14739 states and 16901 transitions. Second operand 12 states. [2018-10-24 22:41:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:50,622 INFO L93 Difference]: Finished difference Result 27725 states and 32101 transitions. [2018-10-24 22:41:50,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 22:41:50,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 234 [2018-10-24 22:41:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:50,661 INFO L225 Difference]: With dead ends: 27725 [2018-10-24 22:41:50,661 INFO L226 Difference]: Without dead ends: 14080 [2018-10-24 22:41:50,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 22:41:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14080 states. [2018-10-24 22:41:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14080 to 13363. [2018-10-24 22:41:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13363 states. [2018-10-24 22:41:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13363 states to 13363 states and 15137 transitions. [2018-10-24 22:41:51,144 INFO L78 Accepts]: Start accepts. Automaton has 13363 states and 15137 transitions. Word has length 234 [2018-10-24 22:41:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:51,144 INFO L481 AbstractCegarLoop]: Abstraction has 13363 states and 15137 transitions. [2018-10-24 22:41:51,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:41:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 13363 states and 15137 transitions. [2018-10-24 22:41:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-24 22:41:51,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:51,159 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-24 22:41:51,159 INFO L424 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:51,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1062056222, now seen corresponding path program 1 times [2018-10-24 22:41:51,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:51,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:51,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:51,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:52,110 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 22:41:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 250 proven. 87 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 22:41:52,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:52,231 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:52,231 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-10-24 22:41:52,231 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [137], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:41:52,234 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:52,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:53,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:53,057 INFO L272 AbstractInterpreter]: Visited 87 different actions 358 times. Merged at 10 different actions 46 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:41:53,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:53,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:53,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:53,063 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:41:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:53,074 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:53,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 275 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 22:41:53,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:41:53,622 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-10-24 22:41:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 216 proven. 15 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-24 22:41:53,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:41:53,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-24 22:41:53,958 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:41:53,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:41:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:41:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:41:53,959 INFO L87 Difference]: Start difference. First operand 13363 states and 15137 transitions. Second operand 12 states. [2018-10-24 22:41:56,305 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 22:41:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:41:57,309 INFO L93 Difference]: Finished difference Result 23442 states and 26517 transitions. [2018-10-24 22:41:57,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 22:41:57,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 243 [2018-10-24 22:41:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:41:57,335 INFO L225 Difference]: With dead ends: 23442 [2018-10-24 22:41:57,335 INFO L226 Difference]: Without dead ends: 11115 [2018-10-24 22:41:57,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 22:41:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11115 states. [2018-10-24 22:41:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11115 to 8189. [2018-10-24 22:41:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8189 states. [2018-10-24 22:41:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8189 states to 8189 states and 8841 transitions. [2018-10-24 22:41:57,562 INFO L78 Accepts]: Start accepts. Automaton has 8189 states and 8841 transitions. Word has length 243 [2018-10-24 22:41:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:41:57,563 INFO L481 AbstractCegarLoop]: Abstraction has 8189 states and 8841 transitions. [2018-10-24 22:41:57,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:41:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8189 states and 8841 transitions. [2018-10-24 22:41:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-24 22:41:57,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:41:57,572 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-24 22:41:57,572 INFO L424 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:41:57,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1984664234, now seen corresponding path program 1 times [2018-10-24 22:41:57,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:41:57,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:57,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:57,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:41:57,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:41:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-24 22:41:58,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:58,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:41:58,048 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-10-24 22:41:58,048 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:41:58,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:41:58,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:41:59,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:41:59,402 INFO L272 AbstractInterpreter]: Visited 87 different actions 362 times. Merged at 10 different actions 50 times. Widened at 1 different actions 7 times. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:41:59,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:41:59,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:41:59,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:41:59,411 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:41:59,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:41:59,419 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:41:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:41:59,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:41:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-24 22:41:59,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:42:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-24 22:42:00,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:42:00,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-10-24 22:42:00,265 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:42:00,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 22:42:00,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 22:42:00,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-24 22:42:00,268 INFO L87 Difference]: Start difference. First operand 8189 states and 8841 transitions. Second operand 7 states. [2018-10-24 22:42:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:42:01,527 INFO L93 Difference]: Finished difference Result 15098 states and 16356 transitions. [2018-10-24 22:42:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 22:42:01,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2018-10-24 22:42:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:42:01,544 INFO L225 Difference]: With dead ends: 15098 [2018-10-24 22:42:01,545 INFO L226 Difference]: Without dead ends: 8456 [2018-10-24 22:42:01,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 543 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:42:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8456 states. [2018-10-24 22:42:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8456 to 8167. [2018-10-24 22:42:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2018-10-24 22:42:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 8798 transitions. [2018-10-24 22:42:01,715 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 8798 transitions. Word has length 271 [2018-10-24 22:42:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:42:01,715 INFO L481 AbstractCegarLoop]: Abstraction has 8167 states and 8798 transitions. [2018-10-24 22:42:01,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 22:42:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 8798 transitions. [2018-10-24 22:42:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-24 22:42:01,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:42:01,725 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-24 22:42:01,725 INFO L424 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:42:01,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:42:01,726 INFO L82 PathProgramCache]: Analyzing trace with hash 683096615, now seen corresponding path program 1 times [2018-10-24 22:42:01,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:42:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:01,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:42:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:01,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:42:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:42:02,655 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-24 22:42:02,890 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 22:42:03,443 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 22:42:03,803 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-24 22:42:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 391 proven. 141 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 22:42:04,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:42:04,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:42:04,407 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-10-24 22:42:04,408 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:42:04,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:42:04,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:42:05,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:42:05,253 INFO L272 AbstractInterpreter]: Visited 88 different actions 370 times. Merged at 11 different actions 54 times. Widened at 1 different actions 8 times. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:42:05,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:42:05,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:42:05,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:42:05,263 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:42:05,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:42:05,272 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:42:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:42:05,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:42:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-24 22:42:05,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:42:05,846 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-24 22:42:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-24 22:42:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:42:06,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 24 [2018-10-24 22:42:06,207 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:42:06,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 22:42:06,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 22:42:06,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-10-24 22:42:06,208 INFO L87 Difference]: Start difference. First operand 8167 states and 8798 transitions. Second operand 22 states. [2018-10-24 22:42:06,501 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 9 [2018-10-24 22:42:07,766 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-10-24 22:42:07,967 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2018-10-24 22:42:08,246 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2018-10-24 22:42:08,652 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-10-24 22:42:10,802 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-10-24 22:42:11,595 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-24 22:42:11,866 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-10-24 22:42:12,248 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-10-24 22:42:12,649 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 22:42:13,573 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-10-24 22:42:13,817 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-24 22:42:17,006 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-10-24 22:42:18,480 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-24 22:42:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:42:19,964 INFO L93 Difference]: Finished difference Result 16175 states and 17485 transitions. [2018-10-24 22:42:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-24 22:42:19,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 301 [2018-10-24 22:42:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:42:19,986 INFO L225 Difference]: With dead ends: 16175 [2018-10-24 22:42:19,986 INFO L226 Difference]: Without dead ends: 9409 [2018-10-24 22:42:20,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 642 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2254 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1355, Invalid=6127, Unknown=0, NotChecked=0, Total=7482 [2018-10-24 22:42:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2018-10-24 22:42:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8003. [2018-10-24 22:42:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2018-10-24 22:42:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 8603 transitions. [2018-10-24 22:42:20,198 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 8603 transitions. Word has length 301 [2018-10-24 22:42:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:42:20,199 INFO L481 AbstractCegarLoop]: Abstraction has 8003 states and 8603 transitions. [2018-10-24 22:42:20,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 22:42:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 8603 transitions. [2018-10-24 22:42:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-24 22:42:20,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:42:20,209 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2018-10-24 22:42:20,209 INFO L424 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:42:20,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:42:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -306271665, now seen corresponding path program 1 times [2018-10-24 22:42:20,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:42:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:20,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:42:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:42:20,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:42:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 22:42:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 22:42:20,406 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 22:42:20,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:42:20 BoogieIcfgContainer [2018-10-24 22:42:20,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 22:42:20,623 INFO L168 Benchmark]: Toolchain (without parser) took 169715.12 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -119.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-24 22:42:20,624 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 22:42:20,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.37 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:20,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:20,626 INFO L168 Benchmark]: Boogie Preprocessor took 93.28 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:20,627 INFO L168 Benchmark]: RCFGBuilder took 3448.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2018-10-24 22:42:20,627 INFO L168 Benchmark]: TraceAbstraction took 165283.99 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 537.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-24 22:42:20,632 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 669.37 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 213.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.28 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3448.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165283.99 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 537.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 392]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; VAL [\old(a)=31, \old(a12)=27, \old(a16)=24, \old(a17)=18, \old(a20)=19, \old(a21)=23, \old(a7)=26, \old(a8)=34, \old(b)=20, \old(c)=21, \old(d)=29, \old(e)=17, \old(f)=28, \old(u)=32, \old(v)=16, \old(w)=30, \old(x)=22, \old(y)=33, \old(z)=25, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L580] int output = -1; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, 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)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, 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)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, 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)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, 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)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, 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)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, 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)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] RET return 25; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=25, d=4, e=5, f=6, input=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, 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)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, 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)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L239] a20 = 0 [L240] a21 = 1 [L241] a17 = 0 [L242] a8 = 14 [L243] a16 = 4 [L244] RET return -1; VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=6, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, 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)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, 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)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] __VERIFIER_error() VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, 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, 208 locations, 1 error locations. UNSAFE Result, 165.2s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 109.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2491 SDtfs, 24777 SDslu, 3574 SDs, 0 SdLazy, 35109 SolverSat, 4025 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.8s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 5359 GetRequests, 4496 SyntacticMatches, 479 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6671 ImplicationChecksByTransitivity, 35.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16602occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.2s AbstIntTime, 14 AbstIntIterations, 6 AbstIntStrong, 0.9968721920088414 AbsIntWeakeningRatio, 0.25934579439252337 AbsIntAvgWeakeningVarsNumRemoved, 4.691588785046729 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 8486 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 5675 NumberOfCodeBlocks, 5608 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 7331 ConstructedInterpolants, 0 QuantifiedInterpolants, 5137182 SizeOfPredicates, 24 NumberOfNonLiveVariables, 5562 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 38 InterpolantComputations, 9 PerfectInterpolantSequences, 8318/9182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...