./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/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 a91a998212d77a3e9dd6829139b4c40272a542d6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 14:50:56,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:50:56,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:50:56,372 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:50:56,372 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:50:56,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:50:56,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:50:56,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:50:56,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:50:56,375 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:50:56,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:50:56,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:50:56,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:50:56,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:50:56,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:50:56,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:50:56,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:50:56,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:50:56,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:50:56,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:50:56,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:50:56,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:50:56,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:50:56,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:50:56,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:50:56,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:50:56,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:50:56,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:50:56,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:50:56,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:50:56,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:50:56,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:50:56,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:50:56,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:50:56,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:50:56,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:50:56,391 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:50:56,399 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:50:56,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:50:56,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:50:56,399 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:50:56,400 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:50:56,400 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:50:56,400 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:50:56,400 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:50:56,400 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:50:56,400 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:50:56,400 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:50:56,401 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:50:56,401 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:50:56,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:50:56,401 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:50:56,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:50:56,402 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:50:56,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:50:56,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:50:56,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:50:56,403 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:50:56,403 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:50:56,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:50:56,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:50:56,404 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:50:56,404 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:50:56,404 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:50:56,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:50:56,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:50:56,404 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:50:56,404 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_32904944-e3dc-4f93-9b33-e9efa34aee76/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 -> a91a998212d77a3e9dd6829139b4c40272a542d6 [2018-11-18 14:50:56,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:50:56,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:50:56,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:50:56,441 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:50:56,441 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:50:56,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c [2018-11-18 14:50:56,487 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/data/c537356fd/53858e8678f149cca5e3f0c172951d16/FLAGc0fc27028 [2018-11-18 14:50:56,942 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:50:56,942 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c [2018-11-18 14:50:56,955 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/data/c537356fd/53858e8678f149cca5e3f0c172951d16/FLAGc0fc27028 [2018-11-18 14:50:57,462 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/data/c537356fd/53858e8678f149cca5e3f0c172951d16 [2018-11-18 14:50:57,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:50:57,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:50:57,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:50:57,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:50:57,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:50:57,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d39cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57, skipping insertion in model container [2018-11-18 14:50:57,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:50:57,511 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:50:57,729 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:50:57,731 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:50:57,799 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:50:57,811 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:50:57,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57 WrapperNode [2018-11-18 14:50:57,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:50:57,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:50:57,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:50:57,812 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:50:57,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:50:57,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:50:57,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:50:57,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:50:57,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... [2018-11-18 14:50:57,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:50:57,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:50:57,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:50:57,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:50:57,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/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-11-18 14:50:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 14:50:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:50:57,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:50:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 14:50:57,981 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 14:50:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:50:57,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:50:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:50:57,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:50:58,940 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:50:58,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:50:58 BoogieIcfgContainer [2018-11-18 14:50:58,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:50:58,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:50:58,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:50:58,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:50:58,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:50:57" (1/3) ... [2018-11-18 14:50:58,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f909128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:50:58, skipping insertion in model container [2018-11-18 14:50:58,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:50:57" (2/3) ... [2018-11-18 14:50:58,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f909128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:50:58, skipping insertion in model container [2018-11-18 14:50:58,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:50:58" (3/3) ... [2018-11-18 14:50:58,947 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label24_false-unreach-call.c [2018-11-18 14:50:58,954 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:50:58,960 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:50:58,973 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:50:59,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:50:59,002 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:50:59,002 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:50:59,002 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:50:59,002 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:50:59,005 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:50:59,005 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:50:59,006 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:50:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-18 14:50:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 14:50:59,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:50:59,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:50:59,032 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:50:59,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:50:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash 823320841, now seen corresponding path program 1 times [2018-11-18 14:50:59,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:50:59,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:50:59,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:50:59,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:50:59,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:50:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:50:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:50:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:50:59,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:50:59,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:50:59,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:50:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:50:59,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:50:59,273 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-18 14:50:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:50:59,837 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-18 14:50:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:50:59,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 14:50:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:50:59,847 INFO L225 Difference]: With dead ends: 574 [2018-11-18 14:50:59,847 INFO L226 Difference]: Without dead ends: 356 [2018-11-18 14:50:59,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:50:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-18 14:50:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-18 14:50:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-18 14:50:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 592 transitions. [2018-11-18 14:50:59,890 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 592 transitions. Word has length 21 [2018-11-18 14:50:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:50:59,890 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 592 transitions. [2018-11-18 14:50:59,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:50:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 592 transitions. [2018-11-18 14:50:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 14:50:59,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:50:59,893 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:50:59,894 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:50:59,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:50:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1112402304, now seen corresponding path program 1 times [2018-11-18 14:50:59,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:50:59,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:50:59,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:50:59,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:50:59,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:50:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:51:00,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:00,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:51:00,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:51:00,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:51:00,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:51:00,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:51:00,057 INFO L87 Difference]: Start difference. First operand 356 states and 592 transitions. Second operand 6 states. [2018-11-18 14:51:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:00,799 INFO L93 Difference]: Finished difference Result 1002 states and 1689 transitions. [2018-11-18 14:51:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:51:00,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-18 14:51:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:51:00,804 INFO L225 Difference]: With dead ends: 1002 [2018-11-18 14:51:00,804 INFO L226 Difference]: Without dead ends: 652 [2018-11-18 14:51:00,806 INFO L604 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-11-18 14:51:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-18 14:51:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 640. [2018-11-18 14:51:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-18 14:51:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2018-11-18 14:51:00,832 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 91 [2018-11-18 14:51:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:51:00,833 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2018-11-18 14:51:00,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:51:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2018-11-18 14:51:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 14:51:00,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:51:00,835 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:00,835 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:51:00,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:00,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2093526668, now seen corresponding path program 1 times [2018-11-18 14:51:00,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:51:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:00,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:00,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:00,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:51:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:51:00,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:00,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:51:00,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:51:00,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:51:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:51:00,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:51:00,922 INFO L87 Difference]: Start difference. First operand 640 states and 960 transitions. Second operand 4 states. [2018-11-18 14:51:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:01,584 INFO L93 Difference]: Finished difference Result 2128 states and 3336 transitions. [2018-11-18 14:51:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:51:01,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-18 14:51:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:51:01,588 INFO L225 Difference]: With dead ends: 2128 [2018-11-18 14:51:01,588 INFO L226 Difference]: Without dead ends: 904 [2018-11-18 14:51:01,591 INFO L604 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-11-18 14:51:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-18 14:51:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-11-18 14:51:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-18 14:51:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1277 transitions. [2018-11-18 14:51:01,610 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1277 transitions. Word has length 101 [2018-11-18 14:51:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:51:01,611 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1277 transitions. [2018-11-18 14:51:01,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:51:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1277 transitions. [2018-11-18 14:51:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 14:51:01,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:51:01,613 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:51:01,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:51:01,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1920891619, now seen corresponding path program 1 times [2018-11-18 14:51:01,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:51:01,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:01,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:01,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:51:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:51:01,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:51:01,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:51:01,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:51:01,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:51:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:51:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:51:01,739 INFO L87 Difference]: Start difference. First operand 904 states and 1277 transitions. Second operand 6 states. [2018-11-18 14:51:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:02,197 INFO L93 Difference]: Finished difference Result 2127 states and 3078 transitions. [2018-11-18 14:51:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:51:02,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-11-18 14:51:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:51:02,202 INFO L225 Difference]: With dead ends: 2127 [2018-11-18 14:51:02,202 INFO L226 Difference]: Without dead ends: 1229 [2018-11-18 14:51:02,203 INFO L604 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-11-18 14:51:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-11-18 14:51:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1208. [2018-11-18 14:51:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-11-18 14:51:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1646 transitions. [2018-11-18 14:51:02,226 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1646 transitions. Word has length 144 [2018-11-18 14:51:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:51:02,226 INFO L480 AbstractCegarLoop]: Abstraction has 1208 states and 1646 transitions. [2018-11-18 14:51:02,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:51:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1646 transitions. [2018-11-18 14:51:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-18 14:51:02,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:51:02,229 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-18 14:51:02,229 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:51:02,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:02,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1935153608, now seen corresponding path program 1 times [2018-11-18 14:51:02,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:51:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:02,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:02,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:51:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 28 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:51:02,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:51:02,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:51:02,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-18 14:51:02,349 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 14:51:02,378 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:51:02,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:51:02,607 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:51:02,608 INFO L272 AbstractInterpreter]: Visited 93 different actions 93 times. Never merged. Never widened. Performed 830 root evaluator evaluations with a maximum evaluation depth of 3. Performed 830 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2018-11-18 14:51:02,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:02,618 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:51:02,839 INFO L227 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 72.74% of their original sizes. [2018-11-18 14:51:02,839 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:51:02,872 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-18 14:51:02,873 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:51:02,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:51:02,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-11-18 14:51:02,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:51:02,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:51:02,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:51:02,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:51:02,874 INFO L87 Difference]: Start difference. First operand 1208 states and 1646 transitions. Second operand 6 states. [2018-11-18 14:51:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:11,645 INFO L93 Difference]: Finished difference Result 2556 states and 3478 transitions. [2018-11-18 14:51:11,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:51:11,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2018-11-18 14:51:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:51:11,648 INFO L225 Difference]: With dead ends: 2556 [2018-11-18 14:51:11,648 INFO L226 Difference]: Without dead ends: 1354 [2018-11-18 14:51:11,650 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:51:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-18 14:51:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-18 14:51:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-18 14:51:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1796 transitions. [2018-11-18 14:51:11,670 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1796 transitions. Word has length 192 [2018-11-18 14:51:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:51:11,670 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1796 transitions. [2018-11-18 14:51:11,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:51:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1796 transitions. [2018-11-18 14:51:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-18 14:51:11,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:51:11,673 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:51:11,673 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:51:11,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2141226182, now seen corresponding path program 1 times [2018-11-18 14:51:11,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:51:11,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:11,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:11,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:11,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:51:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 116 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-18 14:51:12,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:51:12,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:51:12,235 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-11-18 14:51:12,235 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 14:51:12,237 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:51:12,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:51:14,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:51:14,134 INFO L272 AbstractInterpreter]: Visited 98 different actions 390 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Performed 3751 root evaluator evaluations with a maximum evaluation depth of 20. Performed 3751 inverse root evaluator evaluations with a maximum inverse evaluation depth of 20. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-18 14:51:14,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:14,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:51:14,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:51:14,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/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-11-18 14:51:14,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:14,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:51:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:14,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:51:14,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:51:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 116 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-18 14:51:14,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:51:14,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 18 [2018-11-18 14:51:14,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:51:14,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 14:51:14,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 14:51:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:51:14,636 INFO L87 Difference]: Start difference. First operand 1352 states and 1796 transitions. Second operand 17 states. [2018-11-18 14:51:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:17,184 INFO L93 Difference]: Finished difference Result 3848 states and 5527 transitions. [2018-11-18 14:51:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 14:51:17,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 263 [2018-11-18 14:51:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:51:17,192 INFO L225 Difference]: With dead ends: 3848 [2018-11-18 14:51:17,192 INFO L226 Difference]: Without dead ends: 2646 [2018-11-18 14:51:17,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 547 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=550, Invalid=1612, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 14:51:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2018-11-18 14:51:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2572. [2018-11-18 14:51:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2572 states. [2018-11-18 14:51:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3284 transitions. [2018-11-18 14:51:17,240 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3284 transitions. Word has length 263 [2018-11-18 14:51:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:51:17,241 INFO L480 AbstractCegarLoop]: Abstraction has 2572 states and 3284 transitions. [2018-11-18 14:51:17,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 14:51:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3284 transitions. [2018-11-18 14:51:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-18 14:51:17,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:51:17,246 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:51:17,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:51:17,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash -573304603, now seen corresponding path program 1 times [2018-11-18 14:51:17,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:51:17,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:17,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:17,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:17,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:51:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 133 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:51:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:51:17,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:51:17,567 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-11-18 14:51:17,567 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [566], [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-11-18 14:51:17,570 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:51:17,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:51:18,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:51:18,978 INFO L272 AbstractInterpreter]: Visited 126 different actions 376 times. Merged at 8 different actions 22 times. Never widened. Performed 3895 root evaluator evaluations with a maximum evaluation depth of 20. Performed 3895 inverse root evaluator evaluations with a maximum inverse evaluation depth of 20. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-18 14:51:18,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:18,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:51:18,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:51:18,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/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-11-18 14:51:19,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:19,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:51:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:19,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:39,048 WARN L180 SmtUtils]: Spent 19.87 s on a formula simplification. DAG size of input: 184 DAG size of output: 53 [2018-11-18 14:51:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 277 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:51:39,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:51:46,069 WARN L180 SmtUtils]: Spent 6.50 s on a formula simplification. DAG size of input: 187 DAG size of output: 22 [2018-11-18 14:51:46,129 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 14:51:46,181 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-11-18 14:51:46,323 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,367 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,397 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,440 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,469 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,502 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,560 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,590 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,620 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,651 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,697 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,735 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,773 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,812 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,841 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,913 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,950 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:46,985 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,023 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,058 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,120 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,149 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,186 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,226 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,255 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,287 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,327 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,365 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,477 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,507 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,539 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,570 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,632 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,662 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,696 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,730 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,761 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,825 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,869 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:47,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,011 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,047 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,092 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,144 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,183 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,211 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,239 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,354 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,391 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,430 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,500 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,530 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,560 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,621 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,663 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,699 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,773 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,801 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,829 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,856 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,913 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,939 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:48,973 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,029 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,058 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,086 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,113 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,142 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,170 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,260 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,295 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,389 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,431 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,475 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,521 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,558 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,588 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,675 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,711 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,742 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,779 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,810 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,838 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,867 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,896 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,937 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:49,976 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:50,014 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:50,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 14:51:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 52 proven. 239 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:51:50,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:51:50,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-11-18 14:51:50,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:51:50,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:51:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:51:50,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-11-18 14:51:50,482 INFO L87 Difference]: Start difference. First operand 2572 states and 3284 transitions. Second operand 18 states. [2018-11-18 14:52:06,141 WARN L180 SmtUtils]: Spent 12.36 s on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-11-18 14:52:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:07,458 INFO L93 Difference]: Finished difference Result 8671 states and 11712 transitions. [2018-11-18 14:52:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 14:52:07,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 308 [2018-11-18 14:52:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:52:07,479 INFO L225 Difference]: With dead ends: 8671 [2018-11-18 14:52:07,479 INFO L226 Difference]: Without dead ends: 6249 [2018-11-18 14:52:07,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 528 SyntacticMatches, 111 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3407 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=805, Invalid=2855, Unknown=0, NotChecked=0, Total=3660 [2018-11-18 14:52:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6249 states. [2018-11-18 14:52:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6249 to 5961. [2018-11-18 14:52:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5961 states. [2018-11-18 14:52:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 7510 transitions. [2018-11-18 14:52:07,622 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 7510 transitions. Word has length 308 [2018-11-18 14:52:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:52:07,622 INFO L480 AbstractCegarLoop]: Abstraction has 5961 states and 7510 transitions. [2018-11-18 14:52:07,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:52:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 7510 transitions. [2018-11-18 14:52:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-18 14:52:07,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:52:07,635 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:52:07,635 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:52:07,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash -372002746, now seen corresponding path program 1 times [2018-11-18 14:52:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:52:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:07,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:07,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:52:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:52:08,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:52:08,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:52:08,057 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-11-18 14:52:08,058 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [566], [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-11-18 14:52:08,060 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:52:08,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:52:09,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:52:09,463 INFO L272 AbstractInterpreter]: Visited 145 different actions 571 times. Merged at 8 different actions 27 times. Never widened. Performed 6137 root evaluator evaluations with a maximum evaluation depth of 20. Performed 6137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 20. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-18 14:52:09,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:09,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:52:09,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:52:09,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:52:09,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:09,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:52:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:09,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:52:20,982 WARN L180 SmtUtils]: Spent 8.72 s on a formula simplification. DAG size of input: 1629 DAG size of output: 49 [2018-11-18 14:52:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 48 proven. 167 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 14:52:21,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:52:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 14:52:23,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:52:23,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 5] total 22 [2018-11-18 14:52:23,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:52:23,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 14:52:23,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 14:52:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=390, Unknown=1, NotChecked=0, Total=462 [2018-11-18 14:52:23,651 INFO L87 Difference]: Start difference. First operand 5961 states and 7510 transitions. Second operand 20 states. [2018-11-18 14:52:32,537 WARN L180 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-11-18 14:52:48,771 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-18 14:53:06,358 WARN L180 SmtUtils]: Spent 16.09 s on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-11-18 14:53:16,455 WARN L180 SmtUtils]: Spent 10.08 s on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-11-18 14:53:26,764 WARN L180 SmtUtils]: Spent 8.04 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 14:53:33,101 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-18 14:53:39,201 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 14:54:00,198 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-18 14:55:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:17,211 INFO L93 Difference]: Finished difference Result 15446 states and 20682 transitions. [2018-11-18 14:55:17,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-18 14:55:17,212 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 327 [2018-11-18 14:55:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:17,244 INFO L225 Difference]: With dead ends: 15446 [2018-11-18 14:55:17,244 INFO L226 Difference]: Without dead ends: 9490 [2018-11-18 14:55:17,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 658 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 81.0s TimeCoverageRelationStatistics Valid=1537, Invalid=7388, Unknown=5, NotChecked=0, Total=8930 [2018-11-18 14:55:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9490 states. [2018-11-18 14:55:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9490 to 7892. [2018-11-18 14:55:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7892 states. [2018-11-18 14:55:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 9738 transitions. [2018-11-18 14:55:17,477 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 9738 transitions. Word has length 327 [2018-11-18 14:55:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:17,478 INFO L480 AbstractCegarLoop]: Abstraction has 7892 states and 9738 transitions. [2018-11-18 14:55:17,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 14:55:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 9738 transitions. [2018-11-18 14:55:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-11-18 14:55:17,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:17,493 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 14:55:17,493 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:17,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash 249953308, now seen corresponding path program 1 times [2018-11-18 14:55:17,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:55:17,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:17,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:17,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:55:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 134 proven. 82 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 14:55:17,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:17,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:55:17,943 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-11-18 14:55:17,943 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [570], [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], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 14:55:17,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:55:17,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:55:18,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:55:18,114 INFO L272 AbstractInterpreter]: Visited 148 different actions 442 times. Merged at 8 different actions 22 times. Never widened. Performed 4797 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4797 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-18 14:55:18,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:18,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:55:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:18,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:55:18,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:18,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:55:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:18,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:55:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 280 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:55:18,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:55:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 134 proven. 82 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 14:55:18,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:55:18,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-11-18 14:55:18,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:55:18,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 14:55:18,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 14:55:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:55:18,373 INFO L87 Difference]: Start difference. First operand 7892 states and 9738 transitions. Second operand 15 states. [2018-11-18 14:55:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:20,755 INFO L93 Difference]: Finished difference Result 16898 states and 21493 transitions. [2018-11-18 14:55:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 14:55:20,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 331 [2018-11-18 14:55:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:20,775 INFO L225 Difference]: With dead ends: 16898 [2018-11-18 14:55:20,776 INFO L226 Difference]: Without dead ends: 9156 [2018-11-18 14:55:20,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 687 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=652, Invalid=2000, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 14:55:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9156 states. [2018-11-18 14:55:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9156 to 8327. [2018-11-18 14:55:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8327 states. [2018-11-18 14:55:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 9630 transitions. [2018-11-18 14:55:20,895 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 9630 transitions. Word has length 331 [2018-11-18 14:55:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:20,895 INFO L480 AbstractCegarLoop]: Abstraction has 8327 states and 9630 transitions. [2018-11-18 14:55:20,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 14:55:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 9630 transitions. [2018-11-18 14:55:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-18 14:55:20,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:20,902 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-18 14:55:20,902 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:20,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:20,902 INFO L82 PathProgramCache]: Analyzing trace with hash 558776319, now seen corresponding path program 1 times [2018-11-18 14:55:20,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:55:20,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:20,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:20,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:20,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:55:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 214 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:55:21,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:21,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:55:21,250 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 337 with the following transitions: [2018-11-18 14:55:21,250 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [602], [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-11-18 14:55:21,252 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:55:21,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:55:22,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:55:22,361 INFO L272 AbstractInterpreter]: Visited 145 different actions 572 times. Merged at 8 different actions 28 times. Never widened. Performed 6148 root evaluator evaluations with a maximum evaluation depth of 21. Performed 6148 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-18 14:55:22,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:22,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:55:22,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:22,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:55:22,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:22,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:55:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:22,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:55:37,219 WARN L180 SmtUtils]: Spent 9.31 s on a formula simplification. DAG size of input: 5817 DAG size of output: 29 [2018-11-18 14:55:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-18 14:55:37,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:55:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-18 14:55:37,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:55:37,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 18 [2018-11-18 14:55:37,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:55:37,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 14:55:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:55:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=251, Unknown=2, NotChecked=0, Total=306 [2018-11-18 14:55:37,379 INFO L87 Difference]: Start difference. First operand 8327 states and 9630 transitions. Second operand 16 states. [2018-11-18 14:55:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:43,876 INFO L93 Difference]: Finished difference Result 20174 states and 23924 transitions. [2018-11-18 14:55:43,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-18 14:55:43,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 336 [2018-11-18 14:55:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:43,899 INFO L225 Difference]: With dead ends: 20174 [2018-11-18 14:55:43,899 INFO L226 Difference]: Without dead ends: 12147 [2018-11-18 14:55:43,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 702 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=868, Invalid=3290, Unknown=2, NotChecked=0, Total=4160 [2018-11-18 14:55:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12147 states. [2018-11-18 14:55:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12147 to 10498. [2018-11-18 14:55:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10498 states. [2018-11-18 14:55:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10498 states to 10498 states and 12230 transitions. [2018-11-18 14:55:44,100 INFO L78 Accepts]: Start accepts. Automaton has 10498 states and 12230 transitions. Word has length 336 [2018-11-18 14:55:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:44,101 INFO L480 AbstractCegarLoop]: Abstraction has 10498 states and 12230 transitions. [2018-11-18 14:55:44,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 14:55:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 10498 states and 12230 transitions. [2018-11-18 14:55:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-18 14:55:44,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:44,115 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-18 14:55:44,115 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:44,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1236242983, now seen corresponding path program 1 times [2018-11-18 14:55:44,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:55:44,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:44,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:44,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:44,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:55:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 119 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-18 14:55:44,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:44,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:55:44,367 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 347 with the following transitions: [2018-11-18 14:55:44,367 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [547], [551], [555], [558], [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], [679], [683], [687], [691], [695], [699], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 14:55:44,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:55:44,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:55:44,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:55:44,531 INFO L272 AbstractInterpreter]: Visited 133 different actions 392 times. Merged at 8 different actions 17 times. Never widened. Performed 4153 root evaluator evaluations with a maximum evaluation depth of 18. Performed 4153 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-18 14:55:44,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:44,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:55:44,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:44,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:55:44,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:44,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:55:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:44,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:55:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 14:55:44,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:55:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 14:55:44,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:55:44,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-18 14:55:44,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:55:44,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:55:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:55:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:55:44,754 INFO L87 Difference]: Start difference. First operand 10498 states and 12230 transitions. Second operand 11 states. [2018-11-18 14:55:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:45,678 INFO L93 Difference]: Finished difference Result 20434 states and 24140 transitions. [2018-11-18 14:55:45,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 14:55:45,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 346 [2018-11-18 14:55:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:45,696 INFO L225 Difference]: With dead ends: 20434 [2018-11-18 14:55:45,696 INFO L226 Difference]: Without dead ends: 10238 [2018-11-18 14:55:45,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 696 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:55:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10238 states. [2018-11-18 14:55:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10238 to 9724. [2018-11-18 14:55:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9724 states. [2018-11-18 14:55:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 11126 transitions. [2018-11-18 14:55:45,866 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 11126 transitions. Word has length 346 [2018-11-18 14:55:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:45,866 INFO L480 AbstractCegarLoop]: Abstraction has 9724 states and 11126 transitions. [2018-11-18 14:55:45,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:55:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 11126 transitions. [2018-11-18 14:55:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-18 14:55:45,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:45,875 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 14:55:45,875 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:45,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1572418731, now seen corresponding path program 1 times [2018-11-18 14:55:45,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:55:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:45,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:45,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:55:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 132 proven. 122 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 14:55:46,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:46,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:55:46,293 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 365 with the following transitions: [2018-11-18 14:55:46,293 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [69], [71], [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], [542], [543], [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], [706], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 14:55:46,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:55:46,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:55:46,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:55:46,470 INFO L272 AbstractInterpreter]: Visited 148 different actions 444 times. Merged at 8 different actions 24 times. Never widened. Performed 4830 root evaluator evaluations with a maximum evaluation depth of 9. Performed 4830 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-18 14:55:46,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:46,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:55:46,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:46,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:55:46,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:46,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:55:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:46,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:55:49,645 WARN L180 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-18 14:55:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:55:51,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:55:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-18 14:55:51,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:55:51,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 12] total 19 [2018-11-18 14:55:51,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:55:51,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:55:51,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:55:51,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=282, Unknown=2, NotChecked=0, Total=342 [2018-11-18 14:55:51,973 INFO L87 Difference]: Start difference. First operand 9724 states and 11126 transitions. Second operand 3 states. [2018-11-18 14:55:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:52,296 INFO L93 Difference]: Finished difference Result 19409 states and 22351 transitions. [2018-11-18 14:55:52,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:55:52,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2018-11-18 14:55:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:52,311 INFO L225 Difference]: With dead ends: 19409 [2018-11-18 14:55:52,311 INFO L226 Difference]: Without dead ends: 9987 [2018-11-18 14:55:52,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 720 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=58, Invalid=282, Unknown=2, NotChecked=0, Total=342 [2018-11-18 14:55:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9987 states. [2018-11-18 14:55:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9987 to 9868. [2018-11-18 14:55:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9868 states. [2018-11-18 14:55:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9868 states to 9868 states and 11254 transitions. [2018-11-18 14:55:52,457 INFO L78 Accepts]: Start accepts. Automaton has 9868 states and 11254 transitions. Word has length 364 [2018-11-18 14:55:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:52,458 INFO L480 AbstractCegarLoop]: Abstraction has 9868 states and 11254 transitions. [2018-11-18 14:55:52,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:55:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9868 states and 11254 transitions. [2018-11-18 14:55:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-18 14:55:52,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:52,464 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-18 14:55:52,464 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:52,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash -887559243, now seen corresponding path program 1 times [2018-11-18 14:55:52,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:55:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:52,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:52,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:55:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:55:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:55:52,590 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:55:52,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:55:52 BoogieIcfgContainer [2018-11-18 14:55:52,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:55:52,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:55:52,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:55:52,690 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:55:52,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:50:58" (3/4) ... [2018-11-18 14:55:52,693 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:55:52,830 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32904944-e3dc-4f93-9b33-e9efa34aee76/bin-2019/utaipan/witness.graphml [2018-11-18 14:55:52,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:55:52,831 INFO L168 Benchmark]: Toolchain (without parser) took 295366.28 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 951.2 MB in the beginning and 1.9 GB in the end (delta: -969.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-18 14:55:52,832 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:55:52,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 921.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:52,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 921.7 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:52,832 INFO L168 Benchmark]: Boogie Preprocessor took 52.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:52,832 INFO L168 Benchmark]: RCFGBuilder took 1001.33 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: 100.7 MB). Peak memory consumption was 100.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:52,833 INFO L168 Benchmark]: TraceAbstraction took 293748.99 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -954.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-18 14:55:52,833 INFO L168 Benchmark]: Witness Printer took 140.24 ms. Allocated memory is still 3.4 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:52,837 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 921.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 74.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 921.7 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1001.33 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: 100.7 MB). Peak memory consumption was 100.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 293748.99 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -954.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 140.24 ms. Allocated memory is still 3.4 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 46]: 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)=167155, \old(a10)=167159, \old(a12)=167163, \old(a19)=167156, \old(a4)=167160, \old(inputB)=167162, \old(inputC)=167161, \old(inputD)=167157, \old(inputE)=167154, \old(inputF)=167158, 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=6, 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, \old(input)=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] RET return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=25, a1=169, a10=1, a12=0, a19=9, a4=14, input=6, 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=169, a10=1, a12=0, a19=9, a4=14, calculate_output(input)=25, input=6, 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=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] RET return 24; VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, \result=24, a1=167153, a10=4, a12=0, a19=9, a4=14, input=3, 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=167153, a10=4, a12=0, a19=9, a4=14, calculate_output(input)=24, input=3, 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=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, 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)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L272] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L273] a10 = 1 [L274] a19 = 7 [L276] RET return -1; VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, \result=-1, a1=13, a10=1, a12=0, a19=7, a4=14, input=5, 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=13, a10=1, a12=0, a19=7, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [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=13, a10=1, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND TRUE (((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] __VERIFIER_error() VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, 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, 293.6s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 214.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1270 SDtfs, 19444 SDslu, 2560 SDs, 0 SdLazy, 29312 SolverSat, 5778 SolverUnsat, 150 SolverUnknown, 0 SolverNotchecked, 123.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 5240 GetRequests, 4734 SyntacticMatches, 138 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 9048 ImplicationChecksByTransitivity, 149.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10498occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.6s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.9970524240157749 AbsIntWeakeningRatio, 0.13612565445026178 AbsIntAvgWeakeningVarsNumRemoved, 15.18324607329843 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 5106 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 68.7s InterpolantComputationTime, 5463 NumberOfCodeBlocks, 5463 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 7348 ConstructedInterpolants, 166 QuantifiedInterpolants, 15746229 SizeOfPredicates, 18 NumberOfNonLiveVariables, 3754 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 4803/6513 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...