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_label35_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 22:39:30,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 22:39:30,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 22:39:30,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 22:39:30,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 22:39:30,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 22:39:30,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 22:39:30,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 22:39:30,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 22:39:30,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 22:39:30,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 22:39:30,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 22:39:30,302 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 22:39:30,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 22:39:30,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 22:39:30,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 22:39:30,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 22:39:30,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 22:39:30,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 22:39:30,325 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 22:39:30,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 22:39:30,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 22:39:30,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 22:39:30,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 22:39:30,335 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 22:39:30,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 22:39:30,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 22:39:30,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 22:39:30,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 22:39:30,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 22:39:30,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 22:39:30,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 22:39:30,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 22:39:30,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 22:39:30,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 22:39:30,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 22:39:30,349 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,374 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 22:39:30,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 22:39:30,375 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 22:39:30,379 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 22:39:30,379 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 22:39:30,379 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 22:39:30,379 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 22:39:30,380 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 22:39:30,380 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 22:39:30,380 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 22:39:30,380 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 22:39:30,380 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 22:39:30,380 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 22:39:30,381 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 22:39:30,382 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 22:39:30,382 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 22:39:30,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 22:39:30,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 22:39:30,383 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 22:39:30,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 22:39:30,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 22:39:30,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 22:39:30,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 22:39:30,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 22:39:30,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 22:39:30,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 22:39:30,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 22:39:30,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 22:39:30,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 22:39:30,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 22:39:30,386 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 22:39:30,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 22:39:30,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 22:39:30,387 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 22:39:30,387 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 22:39:30,387 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 22:39:30,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 22:39:30,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 22:39:30,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 22:39:30,458 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 22:39:30,459 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 22:39:30,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c [2018-10-24 22:39:30,514 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0810ece31/2100b979a3aa4e09b6387f9adcb95b88/FLAGa1c5e81e1 [2018-10-24 22:39:31,102 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 22:39:31,102 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c [2018-10-24 22:39:31,129 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0810ece31/2100b979a3aa4e09b6387f9adcb95b88/FLAGa1c5e81e1 [2018-10-24 22:39:31,152 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0810ece31/2100b979a3aa4e09b6387f9adcb95b88 [2018-10-24 22:39:31,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 22:39:31,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 22:39:31,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 22:39:31,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 22:39:31,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 22:39:31,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be2feca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:31, skipping insertion in model container [2018-10-24 22:39:31,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:31" (1/1) ... [2018-10-24 22:39:31,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 22:39:31,273 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 22:39:31,728 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:39:31,740 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 22:39:31,884 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:39:31,903 INFO L193 MainTranslator]: Completed translation [2018-10-24 22:39:31,904 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,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 22:39:31,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 22:39:31,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 22:39:31,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 22:39:31,915 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,934 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:32,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 22:39:32,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 22:39:32,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 22:39:32,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 22:39:32,112 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:32,113 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:32,126 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:32,126 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:32,162 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:32,184 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:32,202 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:32,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 22:39:32,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 22:39:32,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 22:39:32,214 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 22:39:32,215 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:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 22:39:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 22:39:32,296 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 22:39:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 22:39:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 22:39:32,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 22:39:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 22:39:32,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 22:39:35,364 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 22:39:35,369 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,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 22:39:35,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 22:39:35,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 22:39:35,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 22:39:35,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:39:31" (1/3) ... [2018-10-24 22:39:35,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7187c179 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,376 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,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7187c179 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,376 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,379 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label35_false-unreach-call_false-termination.c [2018-10-24 22:39:35,390 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 22:39:35,405 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 22:39:35,426 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 22:39:35,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 22:39:35,473 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 22:39:35,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 22:39:35,473 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 22:39:35,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 22:39:35,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 22:39:35,473 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 22:39:35,473 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 22:39:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-24 22:39:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-24 22:39:35,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:35,511 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:39:35,513 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:35,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1445496115, now seen corresponding path program 1 times [2018-10-24 22:39:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:35,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:35,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:35,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:35,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:36,171 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 22:39:36,311 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,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:36,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:39:36,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:36,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:39:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:39:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:39:36,340 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-24 22:39:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:38,013 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-24 22:39:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:39:38,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-24 22:39:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:38,046 INFO L225 Difference]: With dead ends: 550 [2018-10-24 22:39:38,046 INFO L226 Difference]: Without dead ends: 340 [2018-10-24 22:39:38,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:39:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-24 22:39:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-24 22:39:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-24 22:39:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-24 22:39:38,158 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 87 [2018-10-24 22:39:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:38,159 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-24 22:39:38,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:39:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-24 22:39:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 22:39:38,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:38,172 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:39:38,172 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:38,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1615708658, now seen corresponding path program 1 times [2018-10-24 22:39:38,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:38,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:38,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:38,487 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 22:39:38,646 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:38,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:38,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 22:39:38,647 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:38,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:39:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:39:38,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:39:38,650 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-24 22:39:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:40,736 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-24 22:39:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 22:39:40,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-10-24 22:39:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:40,745 INFO L225 Difference]: With dead ends: 888 [2018-10-24 22:39:40,745 INFO L226 Difference]: Without dead ends: 554 [2018-10-24 22:39:40,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 22:39:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-24 22:39:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-24 22:39:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-24 22:39:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-24 22:39:40,801 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 98 [2018-10-24 22:39:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:40,801 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-24 22:39:40,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:39:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-24 22:39:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 22:39:40,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:40,806 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:39:40,806 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:40,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1047112390, now seen corresponding path program 1 times [2018-10-24 22:39:40,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:40,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:40,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:40,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:40,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:41,013 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,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:41,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:39:41,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:41,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:39:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:39:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:39:41,015 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-10-24 22:39:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:42,069 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-10-24 22:39:42,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:39:42,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-10-24 22:39:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:42,088 INFO L225 Difference]: With dead ends: 1530 [2018-10-24 22:39:42,088 INFO L226 Difference]: Without dead ends: 997 [2018-10-24 22:39:42,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-10-24 22:39:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 994. [2018-10-24 22:39:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-10-24 22:39:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1454 transitions. [2018-10-24 22:39:42,153 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1454 transitions. Word has length 99 [2018-10-24 22:39:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:42,154 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1454 transitions. [2018-10-24 22:39:42,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:39:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1454 transitions. [2018-10-24 22:39:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 22:39:42,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:42,159 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:39:42,160 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:42,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1142498926, now seen corresponding path program 1 times [2018-10-24 22:39:42,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:42,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:42,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:42,430 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 22:39:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:42,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:39:42,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-24 22:39:42,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:42,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 22:39:42,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 22:39:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:39:42,518 INFO L87 Difference]: Start difference. First operand 994 states and 1454 transitions. Second operand 7 states. [2018-10-24 22:39:44,969 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-10-24 22:39:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:46,589 INFO L93 Difference]: Finished difference Result 2916 states and 4395 transitions. [2018-10-24 22:39:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 22:39:46,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-10-24 22:39:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:46,617 INFO L225 Difference]: With dead ends: 2916 [2018-10-24 22:39:46,617 INFO L226 Difference]: Without dead ends: 1928 [2018-10-24 22:39:46,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-24 22:39:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-10-24 22:39:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1878. [2018-10-24 22:39:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1878 states. [2018-10-24 22:39:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2597 transitions. [2018-10-24 22:39:46,700 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2597 transitions. Word has length 100 [2018-10-24 22:39:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:46,701 INFO L481 AbstractCegarLoop]: Abstraction has 1878 states and 2597 transitions. [2018-10-24 22:39:46,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 22:39:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2597 transitions. [2018-10-24 22:39:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-24 22:39:46,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:46,706 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:39:46,706 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:46,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1896825545, now seen corresponding path program 1 times [2018-10-24 22:39:46,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:46,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:46,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:46,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 22:39:46,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:46,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:39:46,916 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-10-24 22:39:46,918 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [21], [22], [26], [30], [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], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:39:46,968 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:39:46,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:39:47,504 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:39:47,506 INFO L272 AbstractInterpreter]: Visited 88 different actions 88 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-24 22:39:47,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:47,540 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:39:47,953 INFO L232 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 79.91% of their original sizes. [2018-10-24 22:39:47,954 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:39:48,216 INFO L413 sIntCurrentIteration]: We have 109 unified AI predicates [2018-10-24 22:39:48,216 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:39:48,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:39:48,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-24 22:39:48,217 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:39:48,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:39:48,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:39:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 22:39:48,219 INFO L87 Difference]: Start difference. First operand 1878 states and 2597 transitions. Second operand 6 states. [2018-10-24 22:39:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:54,329 INFO L93 Difference]: Finished difference Result 3888 states and 5373 transitions. [2018-10-24 22:39:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 22:39:54,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-10-24 22:39:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:54,340 INFO L225 Difference]: With dead ends: 3888 [2018-10-24 22:39:54,341 INFO L226 Difference]: Without dead ends: 2016 [2018-10-24 22:39:54,348 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 110 GetRequests, 105 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:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2018-10-24 22:39:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 2014. [2018-10-24 22:39:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2018-10-24 22:39:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2743 transitions. [2018-10-24 22:39:54,413 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2743 transitions. Word has length 110 [2018-10-24 22:39:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:54,413 INFO L481 AbstractCegarLoop]: Abstraction has 2014 states and 2743 transitions. [2018-10-24 22:39:54,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:39:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2743 transitions. [2018-10-24 22:39:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-24 22:39:54,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:54,418 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,419 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:54,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1308026811, now seen corresponding path program 1 times [2018-10-24 22:39:54,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:54,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:54,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:54,760 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:39:54,760 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2018-10-24 22:39:54,761 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [21], [22], [26], [30], [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], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:39:54,767 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:39:54,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:39:55,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:39:55,082 INFO L272 AbstractInterpreter]: Visited 92 different actions 176 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:39:55,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:55,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:39:55,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:55,123 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:39:55,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:55,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:39:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:55,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:39:55,741 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 22:39:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:55,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:39:56,035 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-24 22:39:56,307 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-10-24 22:39:56,790 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 22:39:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:56,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:39:56,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-24 22:39:56,956 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:39:56,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 22:39:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 22:39:56,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-24 22:39:56,958 INFO L87 Difference]: Start difference. First operand 2014 states and 2743 transitions. Second operand 9 states. [2018-10-24 22:40:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:02,352 INFO L93 Difference]: Finished difference Result 5814 states and 8526 transitions. [2018-10-24 22:40:02,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 22:40:02,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2018-10-24 22:40:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:02,370 INFO L225 Difference]: With dead ends: 5814 [2018-10-24 22:40:02,371 INFO L226 Difference]: Without dead ends: 2815 [2018-10-24 22:40:02,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2018-10-24 22:40:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2018-10-24 22:40:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2528. [2018-10-24 22:40:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2018-10-24 22:40:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3185 transitions. [2018-10-24 22:40:02,469 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3185 transitions. Word has length 112 [2018-10-24 22:40:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:02,469 INFO L481 AbstractCegarLoop]: Abstraction has 2528 states and 3185 transitions. [2018-10-24 22:40:02,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 22:40:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3185 transitions. [2018-10-24 22:40:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 22:40:02,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:02,476 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,477 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:02,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:02,477 INFO L82 PathProgramCache]: Analyzing trace with hash 492771977, now seen corresponding path program 1 times [2018-10-24 22:40:02,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:02,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:02,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:02,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:02,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:40:02,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:02,760 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:02,760 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-10-24 22:40:02,761 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [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], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:02,766 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:02,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:03,236 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:40:03,236 INFO L272 AbstractInterpreter]: Visited 91 different actions 176 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:03,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:03,282 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:40:03,992 INFO L232 lantSequenceWeakener]: Weakened 84 states. On average, predicates are now at 80.3% of their original sizes. [2018-10-24 22:40:03,992 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:40:08,585 INFO L413 sIntCurrentIteration]: We have 141 unified AI predicates [2018-10-24 22:40:08,585 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:40:08,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:40:08,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-24 22:40:08,586 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:40:08,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 22:40:08,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 22:40:08,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:40:08,587 INFO L87 Difference]: Start difference. First operand 2528 states and 3185 transitions. Second operand 15 states. [2018-10-24 22:40:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:21,896 INFO L93 Difference]: Finished difference Result 5652 states and 7303 transitions. [2018-10-24 22:40:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 22:40:21,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-10-24 22:40:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:21,911 INFO L225 Difference]: With dead ends: 5652 [2018-10-24 22:40:21,911 INFO L226 Difference]: Without dead ends: 3266 [2018-10-24 22:40:21,919 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 29 SyntacticMatches, 99 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-24 22:40:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2018-10-24 22:40:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3081. [2018-10-24 22:40:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-10-24 22:40:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3787 transitions. [2018-10-24 22:40:22,002 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3787 transitions. Word has length 142 [2018-10-24 22:40:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:22,002 INFO L481 AbstractCegarLoop]: Abstraction has 3081 states and 3787 transitions. [2018-10-24 22:40:22,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 22:40:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3787 transitions. [2018-10-24 22:40:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-24 22:40:22,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:22,010 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:40:22,010 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:22,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash -359820756, now seen corresponding path program 1 times [2018-10-24 22:40:22,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:22,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 22:40:22,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:22,567 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:22,567 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-24 22:40:22,568 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:22,571 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:22,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:23,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:40:23,354 INFO L272 AbstractInterpreter]: Visited 93 different actions 373 times. Merged at 8 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:40:23,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:23,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:40:23,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:23,361 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:23,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:23,372 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:40:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:23,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:40:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-24 22:40:23,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:40:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 22:40:24,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:40:24,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-24 22:40:24,014 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:40:24,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 22:40:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 22:40:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-24 22:40:24,016 INFO L87 Difference]: Start difference. First operand 3081 states and 3787 transitions. Second operand 11 states. [2018-10-24 22:40:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:26,765 INFO L93 Difference]: Finished difference Result 10562 states and 13806 transitions. [2018-10-24 22:40:26,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 22:40:26,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2018-10-24 22:40:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:26,801 INFO L225 Difference]: With dead ends: 10562 [2018-10-24 22:40:26,801 INFO L226 Difference]: Without dead ends: 8176 [2018-10-24 22:40:26,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 305 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-24 22:40:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2018-10-24 22:40:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8036. [2018-10-24 22:40:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8036 states. [2018-10-24 22:40:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8036 states to 8036 states and 9822 transitions. [2018-10-24 22:40:27,015 INFO L78 Accepts]: Start accepts. Automaton has 8036 states and 9822 transitions. Word has length 151 [2018-10-24 22:40:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:27,016 INFO L481 AbstractCegarLoop]: Abstraction has 8036 states and 9822 transitions. [2018-10-24 22:40:27,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 22:40:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8036 states and 9822 transitions. [2018-10-24 22:40:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-24 22:40:27,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:27,029 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:27,030 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:27,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1177185442, now seen corresponding path program 1 times [2018-10-24 22:40:27,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:27,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:27,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 85 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:40:27,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:27,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:27,836 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-24 22:40:27,836 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:27,840 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:27,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:28,246 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:40:28,246 INFO L272 AbstractInterpreter]: Visited 92 different actions 268 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:40:28,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:28,252 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:40:29,085 INFO L232 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 80.6% of their original sizes. [2018-10-24 22:40:29,085 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:40:32,396 INFO L413 sIntCurrentIteration]: We have 159 unified AI predicates [2018-10-24 22:40:32,397 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:40:32,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:40:32,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 22 [2018-10-24 22:40:32,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:40:32,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 22:40:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 22:40:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:40:32,398 INFO L87 Difference]: Start difference. First operand 8036 states and 9822 transitions. Second operand 15 states. [2018-10-24 22:40:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:40,817 INFO L93 Difference]: Finished difference Result 16365 states and 20104 transitions. [2018-10-24 22:40:40,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 22:40:40,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 160 [2018-10-24 22:40:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:40,856 INFO L225 Difference]: With dead ends: 16365 [2018-10-24 22:40:40,856 INFO L226 Difference]: Without dead ends: 9024 [2018-10-24 22:40:40,876 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 33 SyntacticMatches, 113 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-24 22:40:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9024 states. [2018-10-24 22:40:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9024 to 8734. [2018-10-24 22:40:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8734 states. [2018-10-24 22:40:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8734 states to 8734 states and 10594 transitions. [2018-10-24 22:40:41,104 INFO L78 Accepts]: Start accepts. Automaton has 8734 states and 10594 transitions. Word has length 160 [2018-10-24 22:40:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:41,105 INFO L481 AbstractCegarLoop]: Abstraction has 8734 states and 10594 transitions. [2018-10-24 22:40:41,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 22:40:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8734 states and 10594 transitions. [2018-10-24 22:40:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-24 22:40:41,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:41,120 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:40:41,120 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:41,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1895569456, now seen corresponding path program 1 times [2018-10-24 22:40:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:41,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:41,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:41,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 130 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:40:41,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:41,636 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:41,636 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-10-24 22:40:41,637 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:41,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:41,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:42,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:40:42,199 INFO L272 AbstractInterpreter]: Visited 93 different actions 369 times. Merged at 8 different actions 33 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-24 22:40:42,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:42,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:40:42,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:42,206 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:40:42,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:42,216 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:40:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:42,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:40:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 107 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 22:40:42,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:40:42,539 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-24 22:40:42,727 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-10-24 22:40:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 107 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 22:40:42,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:40:42,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-24 22:40:42,959 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:40:42,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:40:42,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:40:42,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:40:42,960 INFO L87 Difference]: Start difference. First operand 8734 states and 10594 transitions. Second operand 12 states. [2018-10-24 22:40:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:46,848 INFO L93 Difference]: Finished difference Result 16842 states and 21286 transitions. [2018-10-24 22:40:46,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 22:40:46,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2018-10-24 22:40:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:46,878 INFO L225 Difference]: With dead ends: 16842 [2018-10-24 22:40:46,878 INFO L226 Difference]: Without dead ends: 9088 [2018-10-24 22:40:46,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2018-10-24 22:40:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-10-24 22:40:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 8378. [2018-10-24 22:40:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8378 states. [2018-10-24 22:40:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8378 states to 8378 states and 9492 transitions. [2018-10-24 22:40:47,119 INFO L78 Accepts]: Start accepts. Automaton has 8378 states and 9492 transitions. Word has length 176 [2018-10-24 22:40:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:47,119 INFO L481 AbstractCegarLoop]: Abstraction has 8378 states and 9492 transitions. [2018-10-24 22:40:47,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:40:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 8378 states and 9492 transitions. [2018-10-24 22:40:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 22:40:47,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:47,131 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:47,131 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:47,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1488136705, now seen corresponding path program 1 times [2018-10-24 22:40:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:47,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:47,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:47,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:47,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 22:40:47,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:47,574 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:47,574 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-10-24 22:40:47,574 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [130], [134], [138], [142], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:47,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:47,577 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:48,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:40:48,286 INFO L272 AbstractInterpreter]: Visited 94 different actions 475 times. Merged at 9 different actions 53 times. Widened at 1 different actions 6 times. Found 10 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-24 22:40:48,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:48,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:40:48,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:48,294 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:40:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:48,303 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:40:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:48,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:40:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 120 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 22:40:48,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:40:48,777 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-10-24 22:40:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 120 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 22:40:48,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:40:48,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-24 22:40:48,952 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:40:48,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:40:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:40:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:40:48,954 INFO L87 Difference]: Start difference. First operand 8378 states and 9492 transitions. Second operand 12 states. [2018-10-24 22:40:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:51,261 INFO L93 Difference]: Finished difference Result 14015 states and 15945 transitions. [2018-10-24 22:40:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 22:40:51,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2018-10-24 22:40:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:51,279 INFO L225 Difference]: With dead ends: 14015 [2018-10-24 22:40:51,279 INFO L226 Difference]: Without dead ends: 6334 [2018-10-24 22:40:51,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2018-10-24 22:40:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2018-10-24 22:40:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 6320. [2018-10-24 22:40:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2018-10-24 22:40:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 6994 transitions. [2018-10-24 22:40:51,436 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 6994 transitions. Word has length 180 [2018-10-24 22:40:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:51,437 INFO L481 AbstractCegarLoop]: Abstraction has 6320 states and 6994 transitions. [2018-10-24 22:40:51,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:40:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 6994 transitions. [2018-10-24 22:40:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 22:40:51,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:51,448 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:40:51,449 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:51,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 652980181, now seen corresponding path program 1 times [2018-10-24 22:40:51,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:51,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 114 proven. 61 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 22:40:51,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:51,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:40:51,916 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-10-24 22:40:51,917 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [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], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 22:40:51,919 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 22:40:51,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:40:52,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:40:52,617 INFO L272 AbstractInterpreter]: Visited 94 different actions 386 times. Merged at 9 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:40:52,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:52,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:40:52,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:40:52,655 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:40:52,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:52,666 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:40:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:40:52,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:40:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-24 22:40:52,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:40:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 14 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 22:40:53,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:40:53,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-24 22:40:53,005 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:40:53,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 22:40:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 22:40:53,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:40:53,006 INFO L87 Difference]: Start difference. First operand 6320 states and 6994 transitions. Second operand 12 states. [2018-10-24 22:40:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:40:56,664 INFO L93 Difference]: Finished difference Result 14504 states and 16142 transitions. [2018-10-24 22:40:56,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-24 22:40:56,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 202 [2018-10-24 22:40:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:40:56,688 INFO L225 Difference]: With dead ends: 14504 [2018-10-24 22:40:56,688 INFO L226 Difference]: Without dead ends: 8328 [2018-10-24 22:40:56,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 22:40:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2018-10-24 22:40:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 4954. [2018-10-24 22:40:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2018-10-24 22:40:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 5340 transitions. [2018-10-24 22:40:56,836 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 5340 transitions. Word has length 202 [2018-10-24 22:40:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:40:56,837 INFO L481 AbstractCegarLoop]: Abstraction has 4954 states and 5340 transitions. [2018-10-24 22:40:56,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 22:40:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 5340 transitions. [2018-10-24 22:40:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-24 22:40:56,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:40:56,847 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 22:40:56,847 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:40:56,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:40:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1824735087, now seen corresponding path program 1 times [2018-10-24 22:40:56,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:40:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:56,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:40:56,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:40:56,849 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:40:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 22:40:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 22:40:57,014 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 22:40:57,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:40:57 BoogieIcfgContainer [2018-10-24 22:40:57,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 22:40:57,207 INFO L168 Benchmark]: Toolchain (without parser) took 86038.48 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 728.7 MB. Max. memory is 7.1 GB. [2018-10-24 22:40:57,209 INFO L168 Benchmark]: CDTParser took 0.23 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:40:57,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 22:40:57,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.63 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 672.7 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -753.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 22:40:57,211 INFO L168 Benchmark]: Boogie Preprocessor took 113.95 ms. Allocated memory is still 2.1 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 22:40:57,212 INFO L168 Benchmark]: RCFGBuilder took 3155.06 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. [2018-10-24 22:40:57,213 INFO L168 Benchmark]: TraceAbstraction took 81834.03 ms. Allocated memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 656.3 MB. Max. memory is 7.1 GB. [2018-10-24 22:40:57,219 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.23 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 734.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 194.63 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 672.7 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -753.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.95 ms. Allocated memory is still 2.1 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3155.06 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81834.03 ms. Allocated memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 656.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 416]: 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=3, 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 TRUE (((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)) [L55] a7 = 0 [L56] a20 = 1 [L57] a21 = 1 [L58] a16 = 4 [L59] a17 = 1 [L60] a8 = 13 [L61] RET return -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=4, a17=1, a20=1, a21=1, a7=0, 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=1, a21=1, a7=0, a8=13, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=3, 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=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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 FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] __VERIFIER_error() VAL [\old(a16)=4, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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, 81.7s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 55.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1401 SDtfs, 13976 SDslu, 1733 SDs, 0 SdLazy, 18461 SolverSat, 2963 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2298 GetRequests, 1871 SyntacticMatches, 221 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8734occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 8 AbstIntIterations, 3 AbstIntStrong, 0.9969048081218563 AbsIntWeakeningRatio, 0.2713936430317848 AbsIntAvgWeakeningVarsNumRemoved, 8.227383863080684 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 5070 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2668 NumberOfCodeBlocks, 2668 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3237 ConstructedInterpolants, 0 QuantifiedInterpolants, 1087600 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2547 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 1870/2038 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...