./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 842b1d955d5d034fb473369e35dc57ba15dfee95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 01:03:40,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 01:03:40,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 01:03:40,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 01:03:40,235 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 01:03:40,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 01:03:40,237 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 01:03:40,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 01:03:40,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 01:03:40,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 01:03:40,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 01:03:40,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 01:03:40,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 01:03:40,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 01:03:40,245 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 01:03:40,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 01:03:40,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 01:03:40,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 01:03:40,250 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 01:03:40,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 01:03:40,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 01:03:40,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 01:03:40,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 01:03:40,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 01:03:40,262 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 01:03:40,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 01:03:40,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 01:03:40,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 01:03:40,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 01:03:40,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 01:03:40,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 01:03:40,268 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 01:03:40,268 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 01:03:40,268 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 01:03:40,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 01:03:40,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 01:03:40,270 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 01:03:40,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 01:03:40,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 01:03:40,285 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 01:03:40,285 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 01:03:40,285 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 01:03:40,286 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 01:03:40,286 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 01:03:40,286 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 01:03:40,286 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 01:03:40,286 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 01:03:40,286 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 01:03:40,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 01:03:40,287 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 01:03:40,287 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 01:03:40,287 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 01:03:40,287 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 01:03:40,288 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 01:03:40,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 01:03:40,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 01:03:40,288 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 01:03:40,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 01:03:40,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 01:03:40,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 01:03:40,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 01:03:40,289 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 01:03:40,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 01:03:40,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 01:03:40,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 01:03:40,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 01:03:40,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 01:03:40,290 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 01:03:40,291 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 01:03:40,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 01:03:40,291 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 01:03:40,291 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 842b1d955d5d034fb473369e35dc57ba15dfee95 [2018-10-27 01:03:40,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 01:03:40,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 01:03:40,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 01:03:40,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 01:03:40,350 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 01:03:40,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-10-27 01:03:40,402 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/data/3faadd2b4/e78d5611de4143ec9693eb2060da3b57/FLAG5e7dab941 [2018-10-27 01:03:40,852 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 01:03:40,852 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-10-27 01:03:40,865 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/data/3faadd2b4/e78d5611de4143ec9693eb2060da3b57/FLAG5e7dab941 [2018-10-27 01:03:40,877 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/data/3faadd2b4/e78d5611de4143ec9693eb2060da3b57 [2018-10-27 01:03:40,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 01:03:40,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 01:03:40,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:40,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 01:03:40,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 01:03:40,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:40" (1/1) ... [2018-10-27 01:03:40,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f645f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:40, skipping insertion in model container [2018-10-27 01:03:40,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:40" (1/1) ... [2018-10-27 01:03:40,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 01:03:40,945 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 01:03:41,270 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:41,274 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 01:03:41,387 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:41,416 INFO L193 MainTranslator]: Completed translation [2018-10-27 01:03:41,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41 WrapperNode [2018-10-27 01:03:41,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:41,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 01:03:41,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 01:03:41,417 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 01:03:41,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 01:03:41,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 01:03:41,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 01:03:41,525 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 01:03:41,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... [2018-10-27 01:03:41,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 01:03:41,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 01:03:41,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 01:03:41,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 01:03:41,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/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-27 01:03:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 01:03:41,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 01:03:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 01:03:41,812 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 01:03:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 01:03:41,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 01:03:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 01:03:41,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 01:03:44,761 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 01:03:44,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:44 BoogieIcfgContainer [2018-10-27 01:03:44,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 01:03:44,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 01:03:44,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 01:03:44,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 01:03:44,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 01:03:40" (1/3) ... [2018-10-27 01:03:44,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174e3918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:44, skipping insertion in model container [2018-10-27 01:03:44,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:41" (2/3) ... [2018-10-27 01:03:44,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174e3918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:44, skipping insertion in model container [2018-10-27 01:03:44,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:44" (3/3) ... [2018-10-27 01:03:44,770 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label28_false-unreach-call.c [2018-10-27 01:03:44,781 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 01:03:44,792 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 01:03:44,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 01:03:44,844 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 01:03:44,844 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 01:03:44,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 01:03:44,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 01:03:44,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 01:03:44,846 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 01:03:44,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 01:03:44,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 01:03:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-27 01:03:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 01:03:44,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:44,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:44,877 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:44,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1764811988, now seen corresponding path program 1 times [2018-10-27 01:03:44,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:44,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:44,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:45,222 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 01:03:45,307 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-27 01:03:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:45,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 01:03:45,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:45,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 01:03:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 01:03:45,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 01:03:45,328 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-27 01:03:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:46,969 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-27 01:03:46,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 01:03:46,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-27 01:03:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:46,988 INFO L225 Difference]: With dead ends: 574 [2018-10-27 01:03:46,989 INFO L226 Difference]: Without dead ends: 356 [2018-10-27 01:03:46,995 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-27 01:03:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-27 01:03:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-27 01:03:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-27 01:03:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-10-27 01:03:47,066 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 18 [2018-10-27 01:03:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:47,067 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-10-27 01:03:47,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 01:03:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-10-27 01:03:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-27 01:03:47,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:47,071 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:47,072 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:47,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:47,072 INFO L82 PathProgramCache]: Analyzing trace with hash 498515883, now seen corresponding path program 1 times [2018-10-27 01:03:47,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:47,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:47,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:47,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:47,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:47,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 01:03:47,323 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:47,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 01:03:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 01:03:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 01:03:47,326 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-10-27 01:03:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:48,976 INFO L93 Difference]: Finished difference Result 1290 states and 2315 transitions. [2018-10-27 01:03:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 01:03:48,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-10-27 01:03:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:48,983 INFO L225 Difference]: With dead ends: 1290 [2018-10-27 01:03:48,983 INFO L226 Difference]: Without dead ends: 940 [2018-10-27 01:03:48,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 01:03:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-10-27 01:03:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 925. [2018-10-27 01:03:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2018-10-27 01:03:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1443 transitions. [2018-10-27 01:03:49,037 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1443 transitions. Word has length 101 [2018-10-27 01:03:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:49,038 INFO L481 AbstractCegarLoop]: Abstraction has 925 states and 1443 transitions. [2018-10-27 01:03:49,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 01:03:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1443 transitions. [2018-10-27 01:03:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-27 01:03:49,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:49,041 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:49,041 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:49,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1789374603, now seen corresponding path program 1 times [2018-10-27 01:03:49,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:49,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:49,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:49,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:49,044 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:49,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:49,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 01:03:49,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:49,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:49,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:49,280 INFO L87 Difference]: Start difference. First operand 925 states and 1443 transitions. Second operand 6 states. [2018-10-27 01:03:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:52,208 INFO L93 Difference]: Finished difference Result 2535 states and 4089 transitions. [2018-10-27 01:03:52,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 01:03:52,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-10-27 01:03:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:52,222 INFO L225 Difference]: With dead ends: 2535 [2018-10-27 01:03:52,223 INFO L226 Difference]: Without dead ends: 1616 [2018-10-27 01:03:52,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 01:03:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2018-10-27 01:03:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1585. [2018-10-27 01:03:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2018-10-27 01:03:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2320 transitions. [2018-10-27 01:03:52,308 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2320 transitions. Word has length 117 [2018-10-27 01:03:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:52,309 INFO L481 AbstractCegarLoop]: Abstraction has 1585 states and 2320 transitions. [2018-10-27 01:03:52,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2320 transitions. [2018-10-27 01:03:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 01:03:52,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:52,323 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 01:03:52,323 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:52,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:52,323 INFO L82 PathProgramCache]: Analyzing trace with hash 674683355, now seen corresponding path program 1 times [2018-10-27 01:03:52,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:52,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:52,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:52,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:52,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 01:03:52,503 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:52,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:52,504 INFO L87 Difference]: Start difference. First operand 1585 states and 2320 transitions. Second operand 6 states. [2018-10-27 01:03:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:53,345 INFO L93 Difference]: Finished difference Result 3506 states and 5314 transitions. [2018-10-27 01:03:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 01:03:53,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-10-27 01:03:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:53,358 INFO L225 Difference]: With dead ends: 3506 [2018-10-27 01:03:53,359 INFO L226 Difference]: Without dead ends: 1927 [2018-10-27 01:03:53,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 01:03:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2018-10-27 01:03:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1888. [2018-10-27 01:03:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1888 states. [2018-10-27 01:03:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2674 transitions. [2018-10-27 01:03:53,415 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2674 transitions. Word has length 141 [2018-10-27 01:03:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:53,415 INFO L481 AbstractCegarLoop]: Abstraction has 1888 states and 2674 transitions. [2018-10-27 01:03:53,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2674 transitions. [2018-10-27 01:03:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-27 01:03:53,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:53,421 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:53,422 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:53,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash 307682743, now seen corresponding path program 1 times [2018-10-27 01:03:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:53,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:53,794 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 01:03:53,990 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 01:03:54,398 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-27 01:03:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:54,567 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:54,568 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-10-27 01:03:54,569 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:03:54,648 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:03:54,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:03:56,441 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:04:04,913 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 01:04:04,915 INFO L272 AbstractInterpreter]: Visited 91 different actions 516 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 01:04:04,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:04:04,924 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 01:04:07,135 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 76.53% of their original sizes. [2018-10-27 01:04:07,135 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 01:04:27,833 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-10-27 01:04:27,833 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 01:04:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:04:27,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-10-27 01:04:27,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:04:27,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 01:04:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 01:04:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-10-27 01:04:27,835 INFO L87 Difference]: Start difference. First operand 1888 states and 2674 transitions. Second operand 19 states. [2018-10-27 01:06:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:06:12,336 INFO L93 Difference]: Finished difference Result 4763 states and 6872 transitions. [2018-10-27 01:06:12,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 01:06:12,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 181 [2018-10-27 01:06:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:06:12,346 INFO L225 Difference]: With dead ends: 4763 [2018-10-27 01:06:12,346 INFO L226 Difference]: Without dead ends: 2881 [2018-10-27 01:06:12,353 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 27 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2018-10-27 01:06:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2018-10-27 01:06:12,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2670. [2018-10-27 01:06:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-10-27 01:06:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3538 transitions. [2018-10-27 01:06:12,468 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3538 transitions. Word has length 181 [2018-10-27 01:06:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:06:12,469 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 3538 transitions. [2018-10-27 01:06:12,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 01:06:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3538 transitions. [2018-10-27 01:06:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-27 01:06:12,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:06:12,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 01:06:12,475 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:06:12,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:06:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1321868351, now seen corresponding path program 1 times [2018-10-27 01:06:12,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:06:12,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:06:12,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:06:12,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:06:12,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:06:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:06:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:06:12,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:06:12,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:06:12,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-10-27 01:06:12,711 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:06:12,720 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:06:12,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:06:14,363 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:06:19,400 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 01:06:19,400 INFO L272 AbstractInterpreter]: Visited 124 different actions 359 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 01:06:19,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:06:19,409 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 01:06:21,385 INFO L227 lantSequenceWeakener]: Weakened 86 states. On average, predicates are now at 73.33% of their original sizes. [2018-10-27 01:06:21,386 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 01:06:32,517 INFO L415 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2018-10-27 01:06:32,518 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 01:06:32,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:06:32,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-10-27 01:06:32,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:06:32,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 01:06:32,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 01:06:32,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-10-27 01:06:32,519 INFO L87 Difference]: Start difference. First operand 2670 states and 3538 transitions. Second operand 17 states. [2018-10-27 01:08:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:08:04,109 INFO L93 Difference]: Finished difference Result 5375 states and 7312 transitions. [2018-10-27 01:08:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 01:08:04,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 217 [2018-10-27 01:08:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:08:04,118 INFO L225 Difference]: With dead ends: 5375 [2018-10-27 01:08:04,118 INFO L226 Difference]: Without dead ends: 3122 [2018-10-27 01:08:04,124 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 188 SyntacticMatches, 13 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-10-27 01:08:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2018-10-27 01:08:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3112. [2018-10-27 01:08:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2018-10-27 01:08:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4065 transitions. [2018-10-27 01:08:04,304 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4065 transitions. Word has length 217 [2018-10-27 01:08:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:08:04,304 INFO L481 AbstractCegarLoop]: Abstraction has 3112 states and 4065 transitions. [2018-10-27 01:08:04,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 01:08:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4065 transitions. [2018-10-27 01:08:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-27 01:08:04,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:08:04,311 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 01:08:04,311 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:08:04,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:08:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash -164501092, now seen corresponding path program 1 times [2018-10-27 01:08:04,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:08:04,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:08:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:08:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:08:04,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:08:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:08:04,586 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 01:08:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 23 proven. 76 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 01:08:04,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:08:04,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:08:04,826 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-10-27 01:08:04,826 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:08:04,834 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:08:04,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:08:12,771 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 01:08:12,771 INFO L272 AbstractInterpreter]: Visited 143 different actions 417 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 01:08:12,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:08:12,774 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 01:08:13,810 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 75.91% of their original sizes. [2018-10-27 01:08:13,810 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 01:08:24,169 INFO L415 sIntCurrentIteration]: We unified 235 AI predicates to 235 [2018-10-27 01:08:24,169 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 01:08:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:08:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-10-27 01:08:24,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:08:24,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 01:08:24,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 01:08:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-10-27 01:08:24,170 INFO L87 Difference]: Start difference. First operand 3112 states and 4065 transitions. Second operand 23 states. [2018-10-27 01:08:32,458 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:09:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:09:44,851 INFO L93 Difference]: Finished difference Result 6111 states and 8186 transitions. [2018-10-27 01:09:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 01:09:44,852 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 236 [2018-10-27 01:09:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:09:44,860 INFO L225 Difference]: With dead ends: 6111 [2018-10-27 01:09:44,861 INFO L226 Difference]: Without dead ends: 3562 [2018-10-27 01:09:44,866 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 203 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2018-10-27 01:09:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2018-10-27 01:09:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3550. [2018-10-27 01:09:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-10-27 01:09:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4561 transitions. [2018-10-27 01:09:45,063 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4561 transitions. Word has length 236 [2018-10-27 01:09:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:09:45,064 INFO L481 AbstractCegarLoop]: Abstraction has 3550 states and 4561 transitions. [2018-10-27 01:09:45,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 01:09:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4561 transitions. [2018-10-27 01:09:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-27 01:09:45,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:09:45,072 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:09:45,072 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:09:45,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:09:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash -492713537, now seen corresponding path program 1 times [2018-10-27 01:09:45,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:09:45,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:09:45,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:09:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:09:45,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:09:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:09:45,338 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 01:09:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 114 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 01:09:45,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:09:45,541 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:09:45,541 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-10-27 01:09:45,542 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:09:45,544 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:09:45,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:09:46,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:09:48,804 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 01:09:48,805 INFO L272 AbstractInterpreter]: Visited 92 different actions 263 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 01:09:48,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:09:48,813 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 01:09:50,043 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 74.72% of their original sizes. [2018-10-27 01:09:50,043 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 01:09:57,483 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-10-27 01:09:57,483 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 01:09:57,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:09:57,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 28 [2018-10-27 01:09:57,483 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:09:57,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 01:09:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 01:09:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-10-27 01:09:57,485 INFO L87 Difference]: Start difference. First operand 3550 states and 4561 transitions. Second operand 21 states. [2018-10-27 01:11:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:11:04,253 INFO L93 Difference]: Finished difference Result 6916 states and 9102 transitions. [2018-10-27 01:11:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 01:11:04,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 253 [2018-10-27 01:11:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:11:04,264 INFO L225 Difference]: With dead ends: 6916 [2018-10-27 01:11:04,264 INFO L226 Difference]: Without dead ends: 4075 [2018-10-27 01:11:04,269 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 226 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2018-10-27 01:11:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-10-27 01:11:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 4069. [2018-10-27 01:11:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2018-10-27 01:11:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 5155 transitions. [2018-10-27 01:11:04,510 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 5155 transitions. Word has length 253 [2018-10-27 01:11:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:11:04,510 INFO L481 AbstractCegarLoop]: Abstraction has 4069 states and 5155 transitions. [2018-10-27 01:11:04,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 01:11:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 5155 transitions. [2018-10-27 01:11:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-27 01:11:04,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:11:04,519 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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-27 01:11:04,519 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:11:04,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:11:04,519 INFO L82 PathProgramCache]: Analyzing trace with hash -501588609, now seen corresponding path program 1 times [2018-10-27 01:11:04,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:11:04,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:11:04,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:11:04,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:11:04,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:11:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:11:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 39 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-27 01:11:04,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:11:04,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:11:04,729 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-10-27 01:11:04,730 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:11:04,732 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:11:04,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:11:05,819 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:11:26,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:11:26,546 INFO L272 AbstractInterpreter]: Visited 109 different actions 853 times. Merged at 8 different actions 64 times. Widened at 1 different actions 3 times. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 01:11:26,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:11:26,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:11:26,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:11:26,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/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-27 01:11:26,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:11:26,565 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:11:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:11:26,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:11:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:11:26,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:11:27,309 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 01:11:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 114 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 01:11:27,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:11:27,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 01:11:27,760 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:11:27,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 01:11:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 01:11:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 01:11:27,762 INFO L87 Difference]: Start difference. First operand 4069 states and 5155 transitions. Second operand 11 states. [2018-10-27 01:11:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:11:30,824 INFO L93 Difference]: Finished difference Result 9120 states and 12122 transitions. [2018-10-27 01:11:30,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 01:11:30,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 275 [2018-10-27 01:11:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:11:30,832 INFO L225 Difference]: With dead ends: 9120 [2018-10-27 01:11:30,833 INFO L226 Difference]: Without dead ends: 3466 [2018-10-27 01:11:30,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 557 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-27 01:11:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2018-10-27 01:11:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3098. [2018-10-27 01:11:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-10-27 01:11:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 3590 transitions. [2018-10-27 01:11:31,113 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 3590 transitions. Word has length 275 [2018-10-27 01:11:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:11:31,114 INFO L481 AbstractCegarLoop]: Abstraction has 3098 states and 3590 transitions. [2018-10-27 01:11:31,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 01:11:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 3590 transitions. [2018-10-27 01:11:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-27 01:11:31,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:11:31,122 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-27 01:11:31,122 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:11:31,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:11:31,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1680817671, now seen corresponding path program 1 times [2018-10-27 01:11:31,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:11:31,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:11:31,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:11:31,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:11:31,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:11:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:11:31,594 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-27 01:11:31,962 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 01:11:32,155 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 01:11:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 39 proven. 241 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 01:11:32,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:11:32,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:11:32,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2018-10-27 01:11:32,299 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:11:32,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:11:32,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:11:33,694 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:11:57,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:11:57,639 INFO L272 AbstractInterpreter]: Visited 126 different actions 864 times. Merged at 8 different actions 53 times. Widened at 1 different actions 2 times. Found 12 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 01:11:57,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:11:57,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:11:57,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:11:57,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/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-27 01:11:57,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:11:57,658 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:11:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:11:57,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:11:58,045 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 32 [2018-10-27 01:11:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 274 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:11:58,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:11:59,096 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:11:59,314 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 118 [2018-10-27 01:11:59,967 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5018 disjunctions. This might take some time... [2018-10-27 01:12:00,012 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 22 disjunctions. [2018-10-27 01:12:00,223 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-27 01:12:00,225 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,228 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,232 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,236 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,240 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,243 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,247 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,251 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,254 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,261 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,265 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,275 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,278 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,288 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,292 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,295 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,299 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,302 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,308 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,312 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,315 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,318 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,322 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,325 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,328 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,331 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,342 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,348 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,352 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,358 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,361 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,364 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,371 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,381 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,387 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,394 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,400 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,403 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,410 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,412 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,423 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,426 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,429 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,432 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,435 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,438 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,441 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,447 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,453 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,462 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,478 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,490 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,493 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,503 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,512 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,515 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,521 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,527 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,530 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,533 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,539 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,546 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,550 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,559 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,562 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,574 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:00,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:12:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 39 proven. 244 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:12:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:12:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-10-27 01:12:01,337 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:12:01,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 01:12:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 01:12:01,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-10-27 01:12:01,338 INFO L87 Difference]: Start difference. First operand 3098 states and 3590 transitions. Second operand 16 states. [2018-10-27 01:12:09,395 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2018-10-27 01:12:35,775 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2018-10-27 01:13:07,802 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2018-10-27 01:13:51,907 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-10-27 01:13:56,328 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2018-10-27 01:14:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:14:01,598 INFO L93 Difference]: Finished difference Result 9033 states and 12191 transitions. [2018-10-27 01:14:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-27 01:14:01,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 311 [2018-10-27 01:14:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:14:01,624 INFO L225 Difference]: With dead ends: 9033 [2018-10-27 01:14:01,624 INFO L226 Difference]: Without dead ends: 6232 [2018-10-27 01:14:01,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 637 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=851, Invalid=3181, Unknown=0, NotChecked=0, Total=4032 [2018-10-27 01:14:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2018-10-27 01:14:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 5753. [2018-10-27 01:14:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5753 states. [2018-10-27 01:14:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5753 states to 5753 states and 7310 transitions. [2018-10-27 01:14:02,027 INFO L78 Accepts]: Start accepts. Automaton has 5753 states and 7310 transitions. Word has length 311 [2018-10-27 01:14:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:14:02,027 INFO L481 AbstractCegarLoop]: Abstraction has 5753 states and 7310 transitions. [2018-10-27 01:14:02,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 01:14:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5753 states and 7310 transitions. [2018-10-27 01:14:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-27 01:14:02,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:14:02,038 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:14:02,038 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:14:02,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:14:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1987886597, now seen corresponding path program 1 times [2018-10-27 01:14:02,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:14:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:14:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:14:02,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:14:02,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:14:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:14:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 204 proven. 206 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-27 01:14:02,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:14:02,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:14:02,328 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 330 with the following transitions: [2018-10-27 01:14:02,328 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [519], [523], [527], [531], [535], [538], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:14:02,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:14:02,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:14:02,803 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:14:07,647 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 01:14:07,647 INFO L272 AbstractInterpreter]: Visited 93 different actions 360 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 01:14:07,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:14:07,657 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 01:14:09,897 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 75.59% of their original sizes. [2018-10-27 01:14:09,897 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 01:14:16,715 INFO L415 sIntCurrentIteration]: We unified 328 AI predicates to 328 [2018-10-27 01:14:16,715 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 01:14:16,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:14:16,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 28 [2018-10-27 01:14:16,715 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:14:16,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 01:14:16,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 01:14:16,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-10-27 01:14:16,716 INFO L87 Difference]: Start difference. First operand 5753 states and 7310 transitions. Second operand 21 states. [2018-10-27 01:15:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:15:57,003 INFO L93 Difference]: Finished difference Result 12203 states and 15675 transitions. [2018-10-27 01:15:57,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 01:15:57,003 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 329 [2018-10-27 01:15:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:15:57,022 INFO L225 Difference]: With dead ends: 12203 [2018-10-27 01:15:57,022 INFO L226 Difference]: Without dead ends: 7042 [2018-10-27 01:15:57,031 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 347 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 01:15:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7042 states. [2018-10-27 01:15:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7042 to 6421. [2018-10-27 01:15:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6421 states. [2018-10-27 01:15:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 8077 transitions. [2018-10-27 01:15:57,476 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 8077 transitions. Word has length 329 [2018-10-27 01:15:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:15:57,477 INFO L481 AbstractCegarLoop]: Abstraction has 6421 states and 8077 transitions. [2018-10-27 01:15:57,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 01:15:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 8077 transitions. [2018-10-27 01:15:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-27 01:15:57,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:15:57,486 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 01:15:57,486 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:15:57,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:15:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2008046940, now seen corresponding path program 1 times [2018-10-27 01:15:57,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:15:57,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:15:57,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:15:57,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:15:57,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:15:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:15:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-27 01:15:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:15:57,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 01:15:57,702 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:15:57,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 01:15:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 01:15:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 01:15:57,703 INFO L87 Difference]: Start difference. First operand 6421 states and 8077 transitions. Second operand 4 states. [2018-10-27 01:15:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:15:59,137 INFO L93 Difference]: Finished difference Result 12432 states and 15565 transitions. [2018-10-27 01:15:59,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 01:15:59,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-10-27 01:15:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:15:59,154 INFO L225 Difference]: With dead ends: 12432 [2018-10-27 01:15:59,154 INFO L226 Difference]: Without dead ends: 5983 [2018-10-27 01:15:59,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 01:15:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2018-10-27 01:15:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 5102. [2018-10-27 01:15:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5102 states. [2018-10-27 01:15:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 6222 transitions. [2018-10-27 01:15:59,486 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 6222 transitions. Word has length 330 [2018-10-27 01:15:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:15:59,487 INFO L481 AbstractCegarLoop]: Abstraction has 5102 states and 6222 transitions. [2018-10-27 01:15:59,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 01:15:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 6222 transitions. [2018-10-27 01:15:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-27 01:15:59,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:15:59,494 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 01:15:59,494 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:15:59,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:15:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2023394721, now seen corresponding path program 1 times [2018-10-27 01:15:59,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:15:59,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:15:59,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:15:59,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:15:59,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:15:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:15:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-27 01:15:59,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:15:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 01:15:59,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:15:59,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 01:15:59,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 01:15:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 01:15:59,668 INFO L87 Difference]: Start difference. First operand 5102 states and 6222 transitions. Second operand 4 states. [2018-10-27 01:16:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:16:00,499 INFO L93 Difference]: Finished difference Result 10475 states and 12868 transitions. [2018-10-27 01:16:00,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 01:16:00,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-10-27 01:16:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:16:00,512 INFO L225 Difference]: With dead ends: 10475 [2018-10-27 01:16:00,512 INFO L226 Difference]: Without dead ends: 5937 [2018-10-27 01:16:00,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 01:16:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5937 states. [2018-10-27 01:16:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5937 to 4970. [2018-10-27 01:16:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4970 states. [2018-10-27 01:16:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 5670 transitions. [2018-10-27 01:16:00,858 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 5670 transitions. Word has length 333 [2018-10-27 01:16:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:16:00,858 INFO L481 AbstractCegarLoop]: Abstraction has 4970 states and 5670 transitions. [2018-10-27 01:16:00,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 01:16:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 5670 transitions. [2018-10-27 01:16:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-27 01:16:00,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:16:00,864 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:16:00,864 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:16:00,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:16:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1855184693, now seen corresponding path program 1 times [2018-10-27 01:16:00,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:16:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:16:00,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:16:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:16:00,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:16:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:16:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:16:01,068 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 01:16:01,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:16:01 BoogieIcfgContainer [2018-10-27 01:16:01,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:16:01,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:16:01,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:16:01,189 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:16:01,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:44" (3/4) ... [2018-10-27 01:16:01,194 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 01:16:01,340 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9837d66e-f773-4163-9cdc-328035ff9cb9/bin-2019/utaipan/witness.graphml [2018-10-27 01:16:01,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:16:01,341 INFO L168 Benchmark]: Toolchain (without parser) took 740460.98 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 954.3 MB in the beginning and 1.9 GB in the end (delta: -910.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-10-27 01:16:01,342 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:16:01,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.89 ms. Allocated memory is still 1.0 GB. Free memory was 954.3 MB in the beginning and 924.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-27 01:16:01,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.13 ms. Allocated memory is still 1.0 GB. Free memory was 924.7 MB in the beginning and 916.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-27 01:16:01,343 INFO L168 Benchmark]: Boogie Preprocessor took 215.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 916.7 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:16:01,343 INFO L168 Benchmark]: RCFGBuilder took 3022.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. [2018-10-27 01:16:01,343 INFO L168 Benchmark]: TraceAbstraction took 736424.71 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -933.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-10-27 01:16:01,344 INFO L168 Benchmark]: Witness Printer took 152.13 ms. Allocated memory is still 5.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 83.0 MB). Peak memory consumption was 83.0 MB. Max. memory is 11.5 GB. [2018-10-27 01:16:01,348 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.89 ms. Allocated memory is still 1.0 GB. Free memory was 954.3 MB in the beginning and 924.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.13 ms. Allocated memory is still 1.0 GB. Free memory was 924.7 MB in the beginning and 916.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 215.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 916.7 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3022.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 736424.71 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -933.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 152.13 ms. Allocated memory is still 5.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 83.0 MB). Peak memory consumption was 83.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: 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)=505234, \old(a10)=505238, \old(a12)=505242, \old(a19)=505235, \old(a4)=505239, \old(inputB)=505241, \old(inputC)=505240, \old(inputD)=505236, \old(inputE)=505233, \old(inputF)=505237, 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=3, 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 FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (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] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (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] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (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] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (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] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) 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] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (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] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 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] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (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] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (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] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (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] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (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] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (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] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (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] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) 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] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (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] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (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] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (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] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (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] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (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] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (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] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (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] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (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] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (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] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) 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] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (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] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) 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] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) 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] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (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] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (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] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (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] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (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] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (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] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (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] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) 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] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (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] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) 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] [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, 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=505232, a10=1, a12=0, a19=9, a4=14, calculate_output(input)=25, input=3, 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=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, 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)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] RET return 25; VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, a1=132, a10=1, a12=0, a19=10, 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=132, a10=1, a12=0, a19=10, a4=14, calculate_output(input)=25, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [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=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, 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)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L455] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L456] a10 = 2 [L457] a19 = 7 [L459] RET return -1; VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, a1=2, a10=2, a12=0, a19=7, 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=2, a10=2, a12=0, a19=7, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [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=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, 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)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, 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)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, 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)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, 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)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, 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)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] __VERIFIER_error() VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, a1=2, a10=2, a12=0, a19=7, 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, 736.3s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 576.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1731 SDtfs, 15270 SDslu, 2308 SDs, 0 SdLazy, 24966 SolverSat, 3480 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 306.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2601 GetRequests, 2271 SyntacticMatches, 70 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 80.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6421occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 80.7s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9944978996876453 AbsIntWeakeningRatio, 0.1222130470685384 AbsIntAvgWeakeningVarsNumRemoved, 543.2559867877787 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 3640 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 3769 NumberOfCodeBlocks, 3769 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3997 ConstructedInterpolants, 126 QuantifiedInterpolants, 7649115 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 2204/3346 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...