java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label46_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 11:43:48,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 11:43:48,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 11:43:48,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 11:43:48,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 11:43:48,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 11:43:48,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 11:43:48,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 11:43:48,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 11:43:48,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 11:43:48,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 11:43:48,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 11:43:48,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 11:43:48,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 11:43:48,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 11:43:48,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 11:43:48,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 11:43:48,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 11:43:48,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 11:43:48,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 11:43:48,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 11:43:48,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 11:43:48,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 11:43:48,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 11:43:48,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 11:43:48,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 11:43:48,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 11:43:48,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 11:43:48,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 11:43:48,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 11:43:48,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 11:43:48,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 11:43:48,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 11:43:48,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 11:43:48,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 11:43:48,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 11:43:48,786 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 11:43:48,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 11:43:48,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 11:43:48,818 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 11:43:48,819 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 11:43:48,819 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 11:43:48,819 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 11:43:48,819 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 11:43:48,820 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 11:43:48,820 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 11:43:48,820 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 11:43:48,821 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 11:43:48,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 11:43:48,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 11:43:48,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 11:43:48,823 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 11:43:48,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 11:43:48,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 11:43:48,824 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 11:43:48,824 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 11:43:48,824 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 11:43:48,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 11:43:48,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 11:43:48,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 11:43:48,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 11:43:48,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 11:43:48,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 11:43:48,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 11:43:48,827 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 11:43:48,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 11:43:48,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 11:43:48,828 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 11:43:48,828 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 11:43:48,829 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 11:43:48,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 11:43:48,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 11:43:48,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 11:43:48,906 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 11:43:48,907 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 11:43:48,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label46_false-unreach-call.c [2018-07-24 11:43:49,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08b6f0a3/dccc031323fc4009a34f805f88d922d0/FLAG71c549a61 [2018-07-24 11:43:49,534 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 11:43:49,535 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label46_false-unreach-call.c [2018-07-24 11:43:49,565 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08b6f0a3/dccc031323fc4009a34f805f88d922d0/FLAG71c549a61 [2018-07-24 11:43:49,594 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08b6f0a3/dccc031323fc4009a34f805f88d922d0 [2018-07-24 11:43:49,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 11:43:49,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 11:43:49,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 11:43:49,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 11:43:49,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 11:43:49,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 11:43:49" (1/1) ... [2018-07-24 11:43:49,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bc4887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:49, skipping insertion in model container [2018-07-24 11:43:49,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 11:43:49" (1/1) ... [2018-07-24 11:43:49,840 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 11:43:50,131 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 11:43:50,151 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 11:43:50,337 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 11:43:50,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50 WrapperNode [2018-07-24 11:43:50,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 11:43:50,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 11:43:50,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 11:43:50,393 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 11:43:50,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 11:43:50,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 11:43:50,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 11:43:50,498 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 11:43:50,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... [2018-07-24 11:43:50,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 11:43:50,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 11:43:50,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 11:43:50,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 11:43:50,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 11:43:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 11:43:50,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 11:43:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 11:43:50,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 11:43:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 11:43:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 11:43:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 11:43:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_output [2018-07-24 11:43:55,240 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 11:43:55,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 11:43:55 BoogieIcfgContainer [2018-07-24 11:43:55,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 11:43:55,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 11:43:55,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 11:43:55,246 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 11:43:55,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 11:43:49" (1/3) ... [2018-07-24 11:43:55,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f931315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 11:43:55, skipping insertion in model container [2018-07-24 11:43:55,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 11:43:50" (2/3) ... [2018-07-24 11:43:55,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f931315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 11:43:55, skipping insertion in model container [2018-07-24 11:43:55,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 11:43:55" (3/3) ... [2018-07-24 11:43:55,250 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label46_false-unreach-call.c [2018-07-24 11:43:55,261 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 11:43:55,271 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 11:43:55,326 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 11:43:55,327 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 11:43:55,327 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 11:43:55,327 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 11:43:55,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 11:43:55,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 11:43:55,328 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 11:43:55,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 11:43:55,328 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 11:43:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-07-24 11:43:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-24 11:43:55,367 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:43:55,369 INFO L353 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] [2018-07-24 11:43:55,369 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:43:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1096247844, now seen corresponding path program 1 times [2018-07-24 11:43:55,377 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:43:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:43:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:55,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:43:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:43:55,861 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-07-24 11:43:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:43:55,878 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:43:55,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 11:43:55,878 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:43:55,885 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 11:43:55,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 11:43:55,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 11:43:55,906 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-07-24 11:43:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:43:58,685 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-07-24 11:43:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 11:43:58,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-07-24 11:43:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:43:58,709 INFO L225 Difference]: With dead ends: 737 [2018-07-24 11:43:58,709 INFO L226 Difference]: Without dead ends: 515 [2018-07-24 11:43:58,719 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 11:43:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-07-24 11:43:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-07-24 11:43:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-07-24 11:43:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 848 transitions. [2018-07-24 11:43:58,830 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 848 transitions. Word has length 28 [2018-07-24 11:43:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:43:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 848 transitions. [2018-07-24 11:43:58,831 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 11:43:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 848 transitions. [2018-07-24 11:43:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-24 11:43:58,840 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:43:58,841 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:43:58,841 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:43:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1078385541, now seen corresponding path program 1 times [2018-07-24 11:43:58,843 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:43:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:43:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:43:58,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:43:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:43:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:43:59,266 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:43:59,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 11:43:59,266 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:43:59,269 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 11:43:59,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 11:43:59,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 11:43:59,270 INFO L87 Difference]: Start difference. First operand 515 states and 848 transitions. Second operand 6 states. [2018-07-24 11:44:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:03,826 INFO L93 Difference]: Finished difference Result 1863 states and 3251 transitions. [2018-07-24 11:44:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 11:44:03,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-07-24 11:44:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:03,847 INFO L225 Difference]: With dead ends: 1863 [2018-07-24 11:44:03,848 INFO L226 Difference]: Without dead ends: 1354 [2018-07-24 11:44:03,858 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 11:44:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-07-24 11:44:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1331. [2018-07-24 11:44:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-07-24 11:44:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2051 transitions. [2018-07-24 11:44:03,978 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2051 transitions. Word has length 103 [2018-07-24 11:44:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:03,979 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 2051 transitions. [2018-07-24 11:44:03,979 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 11:44:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2051 transitions. [2018-07-24 11:44:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-24 11:44:03,989 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:03,989 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:44:03,990 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1651349655, now seen corresponding path program 1 times [2018-07-24 11:44:03,990 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:03,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:03,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:03,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:03,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:44:04,286 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 11:44:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 11:44:04,350 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 11:44:04,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 11:44:04,350 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 11:44:04,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 11:44:04,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 11:44:04,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 11:44:04,352 INFO L87 Difference]: Start difference. First operand 1331 states and 2051 transitions. Second operand 6 states. [2018-07-24 11:44:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:44:08,654 INFO L93 Difference]: Finished difference Result 3512 states and 5693 transitions. [2018-07-24 11:44:08,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 11:44:08,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-07-24 11:44:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:44:08,678 INFO L225 Difference]: With dead ends: 3512 [2018-07-24 11:44:08,679 INFO L226 Difference]: Without dead ends: 2187 [2018-07-24 11:44:08,690 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 11:44:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-07-24 11:44:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2165. [2018-07-24 11:44:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-07-24 11:44:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3178 transitions. [2018-07-24 11:44:08,767 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3178 transitions. Word has length 105 [2018-07-24 11:44:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:44:08,768 INFO L471 AbstractCegarLoop]: Abstraction has 2165 states and 3178 transitions. [2018-07-24 11:44:08,768 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 11:44:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3178 transitions. [2018-07-24 11:44:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-24 11:44:08,771 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:44:08,771 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:44:08,771 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:44:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash -324573584, now seen corresponding path program 1 times [2018-07-24 11:44:08,772 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:44:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:08,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:44:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:44:08,773 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:44:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-24 11:44:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-24 11:44:08,861 INFO L419 BasicCegarLoop]: Counterexample might be feasible [2018-07-24 11:44:09,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 11:44:09 BoogieIcfgContainer [2018-07-24 11:44:09,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 11:44:09,003 INFO L168 Benchmark]: Toolchain (without parser) took 19393.54 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 942.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.0 MB). Peak memory consumption was 191.2 MB. Max. memory is 7.1 GB. [2018-07-24 11:44:09,005 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 11:44:09,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 11:44:09,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 11:44:09,008 INFO L168 Benchmark]: Boogie Preprocessor took 320.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.0 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2018-07-24 11:44:09,009 INFO L168 Benchmark]: RCFGBuilder took 4423.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 112.1 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. [2018-07-24 11:44:09,011 INFO L168 Benchmark]: TraceAbstraction took 13759.61 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 175.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -58.9 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. [2018-07-24 11:44:09,018 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 105.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 320.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.0 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4423.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 112.1 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13759.61 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 175.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -58.9 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 67]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=331510, \old(a10)=331507, \old(a12)=331511, \old(a19)=331515, \old(a4)=331509, \old(inputB)=331514, \old(inputC)=331512, \old(inputD)=331513, \old(inputE)=331508, \old(inputF)=331506, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] __VERIFIER_error() VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 13.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 2115 SDslu, 298 SDs, 0 SdLazy, 3033 SolverSat, 787 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2165occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 119299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label46_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_11-44-09-045.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label46_false-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_11-44-09-045.csv Received shutdown request...