./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c23175fa4336049a9379aeb3b34f319007ef752 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c23175fa4336049a9379aeb3b34f319007ef752 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:47:50,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:47:50,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:47:50,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:47:50,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:47:50,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:47:50,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:47:50,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:47:50,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:47:50,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:47:50,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:47:50,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:47:50,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:47:50,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:47:50,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:47:50,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:47:50,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:47:50,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:47:50,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:47:50,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:47:50,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:47:50,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:47:50,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:47:50,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:47:50,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:47:50,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:47:50,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:47:50,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:47:50,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:47:50,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:47:50,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:47:50,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:47:50,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:47:50,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:47:50,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:47:50,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:47:50,678 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 05:47:50,687 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:47:50,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:47:50,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:47:50,688 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:47:50,689 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:47:50,689 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:47:50,689 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:47:50,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:47:50,690 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:47:50,690 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:47:50,690 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:47:50,690 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:47:50,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:47:50,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:47:50,691 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:47:50,691 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:47:50,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:47:50,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:47:50,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:47:50,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:47:50,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:47:50,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:47:50,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:47:50,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:47:50,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:47:50,692 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:47:50,692 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:47:50,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:47:50,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:47:50,693 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer 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 -> Automizer 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 -> 7c23175fa4336049a9379aeb3b34f319007ef752 [2018-11-10 05:47:50,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:47:50,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:47:50,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:47:50,730 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:47:50,730 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:47:50,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-11-10 05:47:50,770 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/7fbdbe274/b4a3ccc72d1542c08e003a16479dbf75/FLAG25ce06d3c [2018-11-10 05:47:51,220 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:47:51,220 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-11-10 05:47:51,231 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/7fbdbe274/b4a3ccc72d1542c08e003a16479dbf75/FLAG25ce06d3c [2018-11-10 05:47:51,244 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/7fbdbe274/b4a3ccc72d1542c08e003a16479dbf75 [2018-11-10 05:47:51,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:47:51,248 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 05:47:51,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:47:51,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:47:51,251 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:47:51,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51, skipping insertion in model container [2018-11-10 05:47:51,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:47:51,297 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:47:51,509 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:47:51,511 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:47:51,581 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:47:51,594 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:47:51,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51 WrapperNode [2018-11-10 05:47:51,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:47:51,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:47:51,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:47:51,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:47:51,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... [2018-11-10 05:47:51,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:47:51,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:47:51,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:47:51,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:47:51,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:47:51,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:47:51,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:47:51,776 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 05:47:51,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:47:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 05:47:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 05:47:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 05:47:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 05:47:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:47:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:47:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:47:52,644 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:47:52,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:47:52 BoogieIcfgContainer [2018-11-10 05:47:52,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:47:52,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:47:52,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:47:52,649 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:47:52,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:47:51" (1/3) ... [2018-11-10 05:47:52,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32236ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:47:52, skipping insertion in model container [2018-11-10 05:47:52,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:51" (2/3) ... [2018-11-10 05:47:52,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32236ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:47:52, skipping insertion in model container [2018-11-10 05:47:52,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:47:52" (3/3) ... [2018-11-10 05:47:52,652 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label12_false-unreach-call.c [2018-11-10 05:47:52,659 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:47:52,666 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:47:52,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:47:52,700 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:47:52,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:47:52,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:47:52,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:47:52,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:47:52,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:47:52,701 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:47:52,701 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:47:52,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:47:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 05:47:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 05:47:52,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:47:52,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:47:52,728 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:47:52,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:47:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1125399135, now seen corresponding path program 1 times [2018-11-10 05:47:52,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:47:52,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:47:52,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:52,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:47:52,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:47:52,977 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-10 05:47:52,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:47:52,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:47:52,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:47:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:47:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:47:52,996 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 05:47:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:47:53,820 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 05:47:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:47:53,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 05:47:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:47:53,831 INFO L225 Difference]: With dead ends: 574 [2018-11-10 05:47:53,831 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 05:47:53,835 INFO L605 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-10 05:47:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 05:47:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 05:47:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 05:47:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 612 transitions. [2018-11-10 05:47:53,889 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 612 transitions. Word has length 19 [2018-11-10 05:47:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:47:53,889 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 612 transitions. [2018-11-10 05:47:53,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:47:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 612 transitions. [2018-11-10 05:47:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 05:47:53,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:47:53,893 INFO L375 BasicCegarLoop]: trace histogram [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-10 05:47:53,897 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:47:53,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:47:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash 407451016, now seen corresponding path program 1 times [2018-11-10 05:47:53,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:47:53,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:47:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:47:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:47:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:47:54,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:47:54,078 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:47:54,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:47:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:47:54,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:47:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:47:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:47:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-10 05:47:54,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:47:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:47:54,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:47:54,226 INFO L87 Difference]: Start difference. First operand 356 states and 612 transitions. Second operand 5 states. [2018-11-10 05:47:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:47:55,042 INFO L93 Difference]: Finished difference Result 1300 states and 2383 transitions. [2018-11-10 05:47:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:47:55,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-10 05:47:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:47:55,050 INFO L225 Difference]: With dead ends: 1300 [2018-11-10 05:47:55,051 INFO L226 Difference]: Without dead ends: 950 [2018-11-10 05:47:55,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:47:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-11-10 05:47:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 938. [2018-11-10 05:47:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-10 05:47:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1588 transitions. [2018-11-10 05:47:55,092 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1588 transitions. Word has length 97 [2018-11-10 05:47:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:47:55,092 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 1588 transitions. [2018-11-10 05:47:55,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:47:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1588 transitions. [2018-11-10 05:47:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 05:47:55,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:47:55,095 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 05:47:55,096 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:47:55,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:47:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash 820279484, now seen corresponding path program 1 times [2018-11-10 05:47:55,096 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:47:55,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:47:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:55,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:47:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:47:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:47:55,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:47:55,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:47:55,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:47:55,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:47:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:47:55,258 INFO L87 Difference]: Start difference. First operand 938 states and 1588 transitions. Second operand 5 states. [2018-11-10 05:47:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:47:56,646 INFO L93 Difference]: Finished difference Result 2591 states and 4528 transitions. [2018-11-10 05:47:56,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:47:56,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-10 05:47:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:47:56,655 INFO L225 Difference]: With dead ends: 2591 [2018-11-10 05:47:56,655 INFO L226 Difference]: Without dead ends: 1659 [2018-11-10 05:47:56,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:47:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-11-10 05:47:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1645. [2018-11-10 05:47:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2018-11-10 05:47:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2781 transitions. [2018-11-10 05:47:56,691 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2781 transitions. Word has length 139 [2018-11-10 05:47:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:47:56,691 INFO L481 AbstractCegarLoop]: Abstraction has 1645 states and 2781 transitions. [2018-11-10 05:47:56,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:47:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2781 transitions. [2018-11-10 05:47:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 05:47:56,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:47:56,696 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:47:56,696 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:47:56,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:47:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1514660174, now seen corresponding path program 1 times [2018-11-10 05:47:56,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:47:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:47:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:56,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:47:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:47:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:47:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:47:57,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:47:57,120 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:47:57,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:47:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:47:57,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:47:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:47:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:47:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-11-10 05:47:57,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 05:47:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 05:47:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:47:57,266 INFO L87 Difference]: Start difference. First operand 1645 states and 2781 transitions. Second operand 16 states. [2018-11-10 05:48:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:01,617 INFO L93 Difference]: Finished difference Result 5102 states and 10145 transitions. [2018-11-10 05:48:01,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-10 05:48:01,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 210 [2018-11-10 05:48:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:01,640 INFO L225 Difference]: With dead ends: 5102 [2018-11-10 05:48:01,641 INFO L226 Difference]: Without dead ends: 3607 [2018-11-10 05:48:01,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=660, Invalid=2202, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 05:48:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2018-11-10 05:48:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3180. [2018-11-10 05:48:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2018-11-10 05:48:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4806 transitions. [2018-11-10 05:48:01,741 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4806 transitions. Word has length 210 [2018-11-10 05:48:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:01,742 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4806 transitions. [2018-11-10 05:48:01,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 05:48:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4806 transitions. [2018-11-10 05:48:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-10 05:48:01,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:01,746 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:48:01,747 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:01,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash -343372249, now seen corresponding path program 1 times [2018-11-10 05:48:01,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:48:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:48:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:48:01,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:48:01,865 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:48:01,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:01,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:48:02,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:48:02,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-10 05:48:02,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:48:02,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:48:02,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:48:02,005 INFO L87 Difference]: Start difference. First operand 3180 states and 4806 transitions. Second operand 9 states. [2018-11-10 05:48:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:02,779 INFO L93 Difference]: Finished difference Result 6308 states and 10188 transitions. [2018-11-10 05:48:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:48:02,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 235 [2018-11-10 05:48:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:02,789 INFO L225 Difference]: With dead ends: 6308 [2018-11-10 05:48:02,789 INFO L226 Difference]: Without dead ends: 3278 [2018-11-10 05:48:02,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:48:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2018-11-10 05:48:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3174. [2018-11-10 05:48:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2018-11-10 05:48:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4473 transitions. [2018-11-10 05:48:02,850 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4473 transitions. Word has length 235 [2018-11-10 05:48:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:02,851 INFO L481 AbstractCegarLoop]: Abstraction has 3174 states and 4473 transitions. [2018-11-10 05:48:02,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:48:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4473 transitions. [2018-11-10 05:48:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 05:48:02,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:02,856 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 05:48:02,856 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:02,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1120346683, now seen corresponding path program 1 times [2018-11-10 05:48:02,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:48:02,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:48:02,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:02,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:02,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 115 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:48:02,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:48:02,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:48:02,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:03,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:48:03,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:48:03,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-10 05:48:03,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:48:03,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:48:03,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:48:03,125 INFO L87 Difference]: Start difference. First operand 3174 states and 4473 transitions. Second operand 9 states. [2018-11-10 05:48:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:04,366 INFO L93 Difference]: Finished difference Result 7637 states and 11024 transitions. [2018-11-10 05:48:04,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 05:48:04,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2018-11-10 05:48:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:04,382 INFO L225 Difference]: With dead ends: 7637 [2018-11-10 05:48:04,382 INFO L226 Difference]: Without dead ends: 4613 [2018-11-10 05:48:04,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:48:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4613 states. [2018-11-10 05:48:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4613 to 4372. [2018-11-10 05:48:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4372 states. [2018-11-10 05:48:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 5650 transitions. [2018-11-10 05:48:04,493 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 5650 transitions. Word has length 261 [2018-11-10 05:48:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:04,493 INFO L481 AbstractCegarLoop]: Abstraction has 4372 states and 5650 transitions. [2018-11-10 05:48:04,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:48:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 5650 transitions. [2018-11-10 05:48:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 05:48:04,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:04,504 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:48:04,504 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:04,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 581644974, now seen corresponding path program 1 times [2018-11-10 05:48:04,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:48:04,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:48:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:04,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 42 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 05:48:04,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:48:04,691 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:48:04,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:04,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:48:04,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:48:04,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-10 05:48:04,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:48:04,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:48:04,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:48:04,923 INFO L87 Difference]: Start difference. First operand 4372 states and 5650 transitions. Second operand 11 states. [2018-11-10 05:48:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:06,686 INFO L93 Difference]: Finished difference Result 10105 states and 13209 transitions. [2018-11-10 05:48:06,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 05:48:06,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 297 [2018-11-10 05:48:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:06,694 INFO L225 Difference]: With dead ends: 10105 [2018-11-10 05:48:06,694 INFO L226 Difference]: Without dead ends: 2121 [2018-11-10 05:48:06,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-10 05:48:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2018-11-10 05:48:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1576. [2018-11-10 05:48:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-11-10 05:48:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1785 transitions. [2018-11-10 05:48:06,752 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1785 transitions. Word has length 297 [2018-11-10 05:48:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:06,752 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 1785 transitions. [2018-11-10 05:48:06,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:48:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1785 transitions. [2018-11-10 05:48:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-10 05:48:06,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:06,759 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 05:48:06,760 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:06,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:06,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1230776758, now seen corresponding path program 1 times [2018-11-10 05:48:06,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:48:06,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:48:06,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:06,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:06,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:48:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 42 proven. 258 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 05:48:07,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:48:07,195 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:48:07,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:07,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:14,022 WARN L179 SmtUtils]: Spent 6.66 s on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2018-11-10 05:48:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:48:14,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:48:14,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-10 05:48:14,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 05:48:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 05:48:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:48:14,202 INFO L87 Difference]: Start difference. First operand 1576 states and 1785 transitions. Second operand 16 states. [2018-11-10 05:48:16,979 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPrecondition(IncrementalHoareTripleChecker.java:333) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:257) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:689) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-11-10 05:48:16,982 INFO L168 Benchmark]: Toolchain (without parser) took 25735.20 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 531.1 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -75.4 MB). Peak memory consumption was 455.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:48:16,983 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:48:16,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:48:16,984 INFO L168 Benchmark]: Boogie Preprocessor took 123.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -207.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:48:16,984 INFO L168 Benchmark]: RCFGBuilder took 926.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:48:16,985 INFO L168 Benchmark]: TraceAbstraction took 24336.40 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 399.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -6.7 MB). Peak memory consumption was 392.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:48:16,988 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -207.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 926.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24336.40 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 399.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -6.7 MB). Peak memory consumption was 392.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:48:18,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:48:18,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:48:18,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:48:18,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:48:18,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:48:18,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:48:18,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:48:18,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:48:18,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:48:18,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:48:18,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:48:18,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:48:18,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:48:18,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:48:18,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:48:18,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:48:18,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:48:18,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:48:18,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:48:18,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:48:18,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:48:18,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:48:18,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:48:18,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:48:18,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:48:18,349 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:48:18,350 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:48:18,350 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:48:18,351 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:48:18,351 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:48:18,352 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:48:18,352 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:48:18,352 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:48:18,353 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:48:18,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:48:18,354 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 05:48:18,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:48:18,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:48:18,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:48:18,366 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:48:18,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:48:18,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:48:18,367 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:48:18,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:48:18,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:48:18,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:48:18,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:48:18,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:48:18,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:48:18,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:48:18,368 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 05:48:18,368 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 05:48:18,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:48:18,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:48:18,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:48:18,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:48:18,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:48:18,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:48:18,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:48:18,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:48:18,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:48:18,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:48:18,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:48:18,371 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 05:48:18,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:48:18,371 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 05:48:18,371 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 05:48:18,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer 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 -> Automizer 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 -> 7c23175fa4336049a9379aeb3b34f319007ef752 [2018-11-10 05:48:18,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:48:18,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:48:18,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:48:18,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:48:18,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:48:18,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-11-10 05:48:18,454 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/27807d1a5/d1b9359a12674b469122962cdccc26c5/FLAG0ae3c46a8 [2018-11-10 05:48:18,836 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:48:18,837 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/sv-benchmarks/c/eca-rers2012/Problem10_label12_false-unreach-call.c [2018-11-10 05:48:18,847 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/27807d1a5/d1b9359a12674b469122962cdccc26c5/FLAG0ae3c46a8 [2018-11-10 05:48:18,859 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/data/27807d1a5/d1b9359a12674b469122962cdccc26c5 [2018-11-10 05:48:18,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:48:18,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 05:48:18,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:48:18,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:48:18,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:48:18,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:48:18" (1/1) ... [2018-11-10 05:48:18,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@121b5745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:18, skipping insertion in model container [2018-11-10 05:48:18,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:48:18" (1/1) ... [2018-11-10 05:48:18,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:48:18,917 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:48:19,207 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:48:19,211 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:48:19,308 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:48:19,322 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:48:19,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19 WrapperNode [2018-11-10 05:48:19,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:48:19,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:48:19,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:48:19,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:48:19,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... [2018-11-10 05:48:19,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... [2018-11-10 05:48:19,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... [2018-11-10 05:48:19,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... [2018-11-10 05:48:19,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... [2018-11-10 05:48:19,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... [2018-11-10 05:48:19,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... [2018-11-10 05:48:19,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:48:19,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:48:19,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:48:19,464 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:48:19,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/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-10 05:48:19,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:48:19,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:48:19,506 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 05:48:19,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:48:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 05:48:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 05:48:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 05:48:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 05:48:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:48:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:48:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:48:21,716 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:48:21,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:48:21 BoogieIcfgContainer [2018-11-10 05:48:21,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:48:21,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:48:21,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:48:21,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:48:21,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:48:18" (1/3) ... [2018-11-10 05:48:21,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2f5816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:48:21, skipping insertion in model container [2018-11-10 05:48:21,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:48:19" (2/3) ... [2018-11-10 05:48:21,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2f5816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:48:21, skipping insertion in model container [2018-11-10 05:48:21,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:48:21" (3/3) ... [2018-11-10 05:48:21,725 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label12_false-unreach-call.c [2018-11-10 05:48:21,733 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:48:21,739 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:48:21,753 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:48:21,784 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:48:21,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:48:21,784 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:48:21,785 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:48:21,785 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:48:21,785 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:48:21,785 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:48:21,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:48:21,786 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:48:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 05:48:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 05:48:21,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:21,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:48:21,812 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:21,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1125399135, now seen corresponding path program 1 times [2018-11-10 05:48:21,819 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:48:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:48:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:21,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:21,917 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-10 05:48:21,918 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-10 05:48:21,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:48:21,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:48:21,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:48:21,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:48:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:48:21,939 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 05:48:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:24,512 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 05:48:24,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:48:24,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 05:48:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:24,527 INFO L225 Difference]: With dead ends: 574 [2018-11-10 05:48:24,527 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 05:48:24,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:48:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 05:48:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 05:48:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 05:48:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 526 transitions. [2018-11-10 05:48:24,580 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 526 transitions. Word has length 19 [2018-11-10 05:48:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:24,581 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 526 transitions. [2018-11-10 05:48:24,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:48:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 526 transitions. [2018-11-10 05:48:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 05:48:24,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:24,585 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:48:24,585 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:24,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2146016307, now seen corresponding path program 1 times [2018-11-10 05:48:24,587 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:48:24,588 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:48:24,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:24,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:48:24,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:48:24,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:48:24,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:48:24,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:48:24,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:48:24,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:48:24,686 INFO L87 Difference]: Start difference. First operand 356 states and 526 transitions. Second operand 3 states. [2018-11-10 05:48:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:27,318 INFO L93 Difference]: Finished difference Result 850 states and 1333 transitions. [2018-11-10 05:48:27,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:48:27,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-10 05:48:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:27,321 INFO L225 Difference]: With dead ends: 850 [2018-11-10 05:48:27,321 INFO L226 Difference]: Without dead ends: 500 [2018-11-10 05:48:27,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:48:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-10 05:48:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2018-11-10 05:48:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-11-10 05:48:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 695 transitions. [2018-11-10 05:48:27,342 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 695 transitions. Word has length 90 [2018-11-10 05:48:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:27,343 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 695 transitions. [2018-11-10 05:48:27,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:48:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 695 transitions. [2018-11-10 05:48:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 05:48:27,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:27,345 INFO L375 BasicCegarLoop]: trace histogram [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-10 05:48:27,345 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 407451016, now seen corresponding path program 1 times [2018-11-10 05:48:27,346 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:48:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:48:27,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:27,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:48:27,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:48:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:48:27,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:48:27,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-10 05:48:27,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:48:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:48:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:48:27,526 INFO L87 Difference]: Start difference. First operand 500 states and 695 transitions. Second operand 6 states. [2018-11-10 05:48:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:31,564 INFO L93 Difference]: Finished difference Result 1887 states and 2757 transitions. [2018-11-10 05:48:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:48:31,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-10 05:48:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:31,571 INFO L225 Difference]: With dead ends: 1887 [2018-11-10 05:48:31,571 INFO L226 Difference]: Without dead ends: 1393 [2018-11-10 05:48:31,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:48:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-11-10 05:48:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1378. [2018-11-10 05:48:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2018-11-10 05:48:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1859 transitions. [2018-11-10 05:48:31,614 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1859 transitions. Word has length 97 [2018-11-10 05:48:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:31,615 INFO L481 AbstractCegarLoop]: Abstraction has 1378 states and 1859 transitions. [2018-11-10 05:48:31,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:48:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1859 transitions. [2018-11-10 05:48:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 05:48:31,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:31,622 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:48:31,622 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:31,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2045620317, now seen corresponding path program 1 times [2018-11-10 05:48:31,624 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:48:31,624 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:48:31,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:31,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:48:32,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:48:32,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:48:32,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:48:32,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:48:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:48:32,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:48:32,097 INFO L87 Difference]: Start difference. First operand 1378 states and 1859 transitions. Second operand 5 states. [2018-11-10 05:48:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:36,087 INFO L93 Difference]: Finished difference Result 3341 states and 4649 transitions. [2018-11-10 05:48:36,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:48:36,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-11-10 05:48:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:36,098 INFO L225 Difference]: With dead ends: 3341 [2018-11-10 05:48:36,098 INFO L226 Difference]: Without dead ends: 1969 [2018-11-10 05:48:36,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:48:36,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-11-10 05:48:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1943. [2018-11-10 05:48:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2018-11-10 05:48:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2499 transitions. [2018-11-10 05:48:36,140 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2499 transitions. Word has length 217 [2018-11-10 05:48:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:36,140 INFO L481 AbstractCegarLoop]: Abstraction has 1943 states and 2499 transitions. [2018-11-10 05:48:36,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:48:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2499 transitions. [2018-11-10 05:48:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 05:48:36,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:36,144 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:48:36,144 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:36,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash -595029241, now seen corresponding path program 1 times [2018-11-10 05:48:36,146 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:48:36,146 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:48:36,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:36,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:48:36,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:48:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:48:36,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:48:36,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 05:48:36,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:48:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:48:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:48:36,377 INFO L87 Difference]: Start difference. First operand 1943 states and 2499 transitions. Second operand 7 states. [2018-11-10 05:48:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:41,285 INFO L93 Difference]: Finished difference Result 4667 states and 6116 transitions. [2018-11-10 05:48:41,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:48:41,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 219 [2018-11-10 05:48:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:41,294 INFO L225 Difference]: With dead ends: 4667 [2018-11-10 05:48:41,294 INFO L226 Difference]: Without dead ends: 1882 [2018-11-10 05:48:41,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:48:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2018-11-10 05:48:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1580. [2018-11-10 05:48:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2018-11-10 05:48:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1810 transitions. [2018-11-10 05:48:41,343 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 1810 transitions. Word has length 219 [2018-11-10 05:48:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:41,343 INFO L481 AbstractCegarLoop]: Abstraction has 1580 states and 1810 transitions. [2018-11-10 05:48:41,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:48:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1810 transitions. [2018-11-10 05:48:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-10 05:48:41,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:41,347 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 05:48:41,347 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:41,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2124363791, now seen corresponding path program 1 times [2018-11-10 05:48:41,349 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:48:41,350 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:48:41,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:41,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:48:41,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:48:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:48:42,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:48:42,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 05:48:42,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:48:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:48:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:48:42,112 INFO L87 Difference]: Start difference. First operand 1580 states and 1810 transitions. Second operand 7 states. [2018-11-10 05:48:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:48:45,682 INFO L93 Difference]: Finished difference Result 3722 states and 4471 transitions. [2018-11-10 05:48:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:48:45,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 255 [2018-11-10 05:48:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:48:45,691 INFO L225 Difference]: With dead ends: 3722 [2018-11-10 05:48:45,692 INFO L226 Difference]: Without dead ends: 2292 [2018-11-10 05:48:45,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:48:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2018-11-10 05:48:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2277. [2018-11-10 05:48:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2018-11-10 05:48:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2607 transitions. [2018-11-10 05:48:45,742 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2607 transitions. Word has length 255 [2018-11-10 05:48:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:48:45,742 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 2607 transitions. [2018-11-10 05:48:45,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:48:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2607 transitions. [2018-11-10 05:48:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-10 05:48:45,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:48:45,748 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 05:48:45,749 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:48:45,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:48:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1230776758, now seen corresponding path program 1 times [2018-11-10 05:48:45,750 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:48:45,750 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:48:45,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:48:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:48:46,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:48:46,746 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 05:48:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 289 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:48:47,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:48:47,653 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-10 05:48:47,806 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-10 05:48:47,976 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 05:48:48,136 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 05:48:49,017 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-10 05:48:50,040 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 05:48:51,758 WARN L179 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 05:48:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 42 proven. 261 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:48:51,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:48:51,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-10 05:48:51,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:48:51,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:48:51,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:48:51,980 INFO L87 Difference]: Start difference. First operand 2277 states and 2607 transitions. Second operand 13 states. [2018-11-10 05:48:52,907 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 05:48:53,669 WARN L179 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 05:48:55,397 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 05:48:57,087 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-10 05:49:21,061 WARN L179 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-10 05:49:32,998 WARN L179 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-11-10 05:49:38,157 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 05:49:39,374 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 05:51:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:06,610 INFO L93 Difference]: Finished difference Result 5318 states and 6150 transitions. [2018-11-10 05:51:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 05:51:06,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 333 [2018-11-10 05:51:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:06,630 INFO L225 Difference]: With dead ends: 5318 [2018-11-10 05:51:06,631 INFO L226 Difference]: Without dead ends: 3191 [2018-11-10 05:51:06,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 664 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2018-11-10 05:51:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2018-11-10 05:51:06,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 3183. [2018-11-10 05:51:06,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2018-11-10 05:51:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 3596 transitions. [2018-11-10 05:51:06,714 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 3596 transitions. Word has length 333 [2018-11-10 05:51:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:06,714 INFO L481 AbstractCegarLoop]: Abstraction has 3183 states and 3596 transitions. [2018-11-10 05:51:06,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:51:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 3596 transitions. [2018-11-10 05:51:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-10 05:51:06,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:06,722 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2018-11-10 05:51:06,722 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:06,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash -679378190, now seen corresponding path program 1 times [2018-11-10 05:51:06,724 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:51:06,724 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:51:06,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:06,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:51:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-10 05:51:06,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:51:06,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:06,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:51:06,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:51:06,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:51:06,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:51:06,931 INFO L87 Difference]: Start difference. First operand 3183 states and 3596 transitions. Second operand 3 states. [2018-11-10 05:51:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:09,335 INFO L93 Difference]: Finished difference Result 6576 states and 7583 transitions. [2018-11-10 05:51:09,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:51:09,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-11-10 05:51:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:09,342 INFO L225 Difference]: With dead ends: 6576 [2018-11-10 05:51:09,342 INFO L226 Difference]: Without dead ends: 3298 [2018-11-10 05:51:09,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:51:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2018-11-10 05:51:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2018-11-10 05:51:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3298 states. [2018-11-10 05:51:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 3698 transitions. [2018-11-10 05:51:09,393 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 3698 transitions. Word has length 347 [2018-11-10 05:51:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:09,393 INFO L481 AbstractCegarLoop]: Abstraction has 3298 states and 3698 transitions. [2018-11-10 05:51:09,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:51:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 3698 transitions. [2018-11-10 05:51:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-11-10 05:51:09,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:09,397 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 05:51:09,397 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:09,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1230076619, now seen corresponding path program 1 times [2018-11-10 05:51:09,399 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:51:09,399 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:51:09,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:09,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:51:10,592 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 05:51:11,206 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-10 05:51:11,437 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 05:51:11,780 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-10 05:51:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 293 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:51:12,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:51:15,778 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 05:51:16,017 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 05:51:16,329 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-10 05:51:16,673 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-10 05:51:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 235 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 05:51:17,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:51:17,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-10 05:51:17,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 05:51:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 05:51:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-10 05:51:17,785 INFO L87 Difference]: Start difference. First operand 3298 states and 3698 transitions. Second operand 19 states. [2018-11-10 05:51:20,866 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 05:51:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:32,413 INFO L93 Difference]: Finished difference Result 7515 states and 8549 transitions. [2018-11-10 05:51:32,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 05:51:32,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 352 [2018-11-10 05:51:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:32,432 INFO L225 Difference]: With dead ends: 7515 [2018-11-10 05:51:32,432 INFO L226 Difference]: Without dead ends: 4662 [2018-11-10 05:51:32,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 689 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2018-11-10 05:51:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2018-11-10 05:51:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 4523. [2018-11-10 05:51:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4523 states. [2018-11-10 05:51:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 5070 transitions. [2018-11-10 05:51:32,497 INFO L78 Accepts]: Start accepts. Automaton has 4523 states and 5070 transitions. Word has length 352 [2018-11-10 05:51:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:32,498 INFO L481 AbstractCegarLoop]: Abstraction has 4523 states and 5070 transitions. [2018-11-10 05:51:32,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 05:51:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4523 states and 5070 transitions. [2018-11-10 05:51:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-10 05:51:32,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:32,503 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:32,503 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:32,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -185157719, now seen corresponding path program 1 times [2018-11-10 05:51:32,505 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:51:32,505 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:51:32,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:33,850 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 05:51:33,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:51:33 BoogieIcfgContainer [2018-11-10 05:51:33,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:51:33,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:51:33,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:51:33,960 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:51:33,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:48:21" (3/4) ... [2018-11-10 05:51:33,963 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:51:34,103 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ce77819-def3-4b27-816d-3fecb36a36a8/bin-2019/uautomizer/witness.graphml [2018-11-10 05:51:34,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:51:34,105 INFO L168 Benchmark]: Toolchain (without parser) took 195242.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.9 MB). Free memory was 937.9 MB in the beginning and 905.1 MB in the end (delta: 32.9 MB). Peak memory consumption was 387.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:34,106 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:51:34,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.26 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 895.0 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:34,106 INFO L168 Benchmark]: Boogie Preprocessor took 140.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 895.0 MB in the beginning and 1.1 GB in the end (delta: -238.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:34,106 INFO L168 Benchmark]: RCFGBuilder took 2252.52 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: 101.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:34,107 INFO L168 Benchmark]: TraceAbstraction took 192242.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.0 GB in the beginning and 949.0 MB in the end (delta: 83.6 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:34,107 INFO L168 Benchmark]: Witness Printer took 143.79 ms. Allocated memory is still 1.4 GB. Free memory was 949.0 MB in the beginning and 905.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:34,108 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.26 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 895.0 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 140.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 895.0 MB in the beginning and 1.1 GB in the end (delta: -238.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2252.52 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: 101.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 192242.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.0 GB in the beginning and 949.0 MB in the end (delta: 83.6 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB. * Witness Printer took 143.79 ms. Allocated memory is still 1.4 GB. Free memory was 949.0 MB in the beginning and 905.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 40]: 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)=0, \old(a10)=0, \old(a12)=0, \old(a19)=0, \old(a4)=0, \old(inputB)=0, \old(inputC)=0, \old(inputD)=0, \old(inputE)=0, \old(inputF)=0, 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=4294967295] [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=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=4294967295] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] RET return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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=518104, a10=0, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=4294967295] [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=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L297] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L298] a10 = 4 [L300] RET return 26; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=2, 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=4294864736, a10=4, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [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=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, 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)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=4294864736, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; VAL [\old(a1)=4294864736, \old(a10)=4, \old(a19)=9, \old(input)=5, \result=-1, a1=23, a10=3, a12=0, a19=6, 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=23, a10=3, a12=0, a19=6, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [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=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=4294967295] [L590] CALL calculate_output(input) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, 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)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, 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)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, 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)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, 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)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, 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)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, 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)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] __VERIFIER_error() VAL [\old(a1)=23, \old(a10)=3, \old(a19)=6, \old(input)=6, a1=23, a10=3, a12=0, a19=6, a4=14, input=6, 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, 192.1s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 173.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1234 SDtfs, 7771 SDslu, 1286 SDs, 0 SdLazy, 13354 SolverSat, 2264 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 148.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3241 GetRequests, 3148 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4523occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 505 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 2291 NumberOfCodeBlocks, 2291 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 3171 ConstructedInterpolants, 0 QuantifiedInterpolants, 8049115 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2597 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1886/2190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...