./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label47_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_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label47_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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 a94649d534c86b647b53a9f03ccedb03233818a4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:17:59,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:17:59,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:17:59,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:17:59,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:17:59,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:17:59,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:17:59,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:17:59,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:17:59,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:17:59,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:17:59,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:17:59,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:17:59,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:17:59,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:17:59,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:17:59,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:17:59,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:17:59,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:17:59,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:17:59,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:17:59,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:17:59,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:17:59,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:17:59,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:17:59,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:17:59,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:17:59,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:17:59,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:17:59,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:17:59,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:17:59,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:17:59,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:17:59,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:17:59,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:17:59,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:17:59,189 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 19:17:59,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:17:59,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:17:59,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:17:59,202 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:17:59,203 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:17:59,203 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:17:59,203 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:17:59,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:17:59,203 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:17:59,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:17:59,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:17:59,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:17:59,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:17:59,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:17:59,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:17:59,205 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:17:59,205 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:17:59,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:17:59,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:17:59,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:17:59,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:17:59,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:17:59,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:17:59,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:17:59,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:17:59,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:17:59,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:17:59,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:17:59,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:17:59,207 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_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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 -> a94649d534c86b647b53a9f03ccedb03233818a4 [2018-10-26 19:17:59,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:17:59,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:17:59,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:17:59,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:17:59,249 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:17:59,250 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label47_false-unreach-call.c [2018-10-26 19:17:59,295 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/data/ab01122c0/019c320e03d04d3192f990968826b4b4/FLAGd54e7384a [2018-10-26 19:17:59,695 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:17:59,696 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/sv-benchmarks/c/eca-rers2012/Problem10_label47_false-unreach-call.c [2018-10-26 19:17:59,705 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/data/ab01122c0/019c320e03d04d3192f990968826b4b4/FLAGd54e7384a [2018-10-26 19:17:59,717 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/data/ab01122c0/019c320e03d04d3192f990968826b4b4 [2018-10-26 19:17:59,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:17:59,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:17:59,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:17:59,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:17:59,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:17:59,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:17:59" (1/1) ... [2018-10-26 19:17:59,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa72dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:17:59, skipping insertion in model container [2018-10-26 19:17:59,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:17:59" (1/1) ... [2018-10-26 19:17:59,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:17:59,779 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:18:00,073 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:18:00,077 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:18:00,197 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:18:00,210 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:18:00,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00 WrapperNode [2018-10-26 19:18:00,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:18:00,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:18:00,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:18:00,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:18:00,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... [2018-10-26 19:18:00,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... [2018-10-26 19:18:00,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... [2018-10-26 19:18:00,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... [2018-10-26 19:18:00,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... [2018-10-26 19:18:00,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... [2018-10-26 19:18:00,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... [2018-10-26 19:18:00,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:18:00,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:18:00,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:18:00,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:18:00,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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-10-26 19:18:00,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:18:00,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:18:00,447 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-26 19:18:00,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:18:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-26 19:18:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 19:18:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 19:18:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:18:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:18:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:18:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:18:02,859 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:18:02,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:18:02 BoogieIcfgContainer [2018-10-26 19:18:02,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:18:02,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:18:02,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:18:02,864 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:18:02,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:17:59" (1/3) ... [2018-10-26 19:18:02,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26348f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:18:02, skipping insertion in model container [2018-10-26 19:18:02,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:18:00" (2/3) ... [2018-10-26 19:18:02,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26348f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:18:02, skipping insertion in model container [2018-10-26 19:18:02,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:18:02" (3/3) ... [2018-10-26 19:18:02,867 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label47_false-unreach-call.c [2018-10-26 19:18:02,875 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:18:02,884 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:18:02,897 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:18:02,925 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:18:02,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:18:02,926 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:18:02,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:18:02,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:18:02,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:18:02,926 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:18:02,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:18:02,927 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:18:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-26 19:18:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 19:18:02,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:02,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:02,954 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:02,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1783981196, now seen corresponding path program 1 times [2018-10-26 19:18:02,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:02,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:03,320 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:18:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:03,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:03,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:18:03,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:18:03,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:18:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:18:03,459 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-26 19:18:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:04,358 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-26 19:18:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:18:04,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 19:18:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:04,375 INFO L225 Difference]: With dead ends: 574 [2018-10-26 19:18:04,375 INFO L226 Difference]: Without dead ends: 356 [2018-10-26 19:18:04,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:18:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-26 19:18:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-26 19:18:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-26 19:18:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-10-26 19:18:04,436 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 26 [2018-10-26 19:18:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:04,436 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-10-26 19:18:04,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:18:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-10-26 19:18:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 19:18:04,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:04,441 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:04,441 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:04,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:04,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1113022292, now seen corresponding path program 1 times [2018-10-26 19:18:04,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:04,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:04,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:04,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:04,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:04,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:04,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:18:04,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:18:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:18:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:18:04,709 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-10-26 19:18:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:06,134 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-10-26 19:18:06,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:18:06,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-10-26 19:18:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:06,139 INFO L225 Difference]: With dead ends: 867 [2018-10-26 19:18:06,139 INFO L226 Difference]: Without dead ends: 517 [2018-10-26 19:18:06,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:18:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-26 19:18:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-10-26 19:18:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-26 19:18:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-10-26 19:18:06,169 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 100 [2018-10-26 19:18:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:06,170 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-10-26 19:18:06,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:18:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-10-26 19:18:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 19:18:06,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:06,172 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:06,173 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:06,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1943190632, now seen corresponding path program 1 times [2018-10-26 19:18:06,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:06,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:06,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:06,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:06,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:18:06,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:18:06,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:18:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:18:06,330 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 4 states. [2018-10-26 19:18:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:08,029 INFO L93 Difference]: Finished difference Result 1742 states and 2991 transitions. [2018-10-26 19:18:08,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:18:08,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-10-26 19:18:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:08,037 INFO L225 Difference]: With dead ends: 1742 [2018-10-26 19:18:08,037 INFO L226 Difference]: Without dead ends: 1240 [2018-10-26 19:18:08,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:18:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2018-10-26 19:18:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2018-10-26 19:18:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-10-26 19:18:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1869 transitions. [2018-10-26 19:18:08,081 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1869 transitions. Word has length 106 [2018-10-26 19:18:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:08,081 INFO L481 AbstractCegarLoop]: Abstraction has 1240 states and 1869 transitions. [2018-10-26 19:18:08,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:18:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1869 transitions. [2018-10-26 19:18:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 19:18:08,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:08,091 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:08,091 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:08,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash 815246527, now seen corresponding path program 1 times [2018-10-26 19:18:08,092 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:08,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:08,402 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:18:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:08,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:08,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:18:08,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:18:08,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:18:08,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:18:08,851 INFO L87 Difference]: Start difference. First operand 1240 states and 1869 transitions. Second operand 6 states. [2018-10-26 19:18:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:09,941 INFO L93 Difference]: Finished difference Result 2759 states and 4120 transitions. [2018-10-26 19:18:09,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:18:09,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-10-26 19:18:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:09,952 INFO L225 Difference]: With dead ends: 2759 [2018-10-26 19:18:09,953 INFO L226 Difference]: Without dead ends: 1525 [2018-10-26 19:18:09,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:18:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-26 19:18:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1485. [2018-10-26 19:18:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-10-26 19:18:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2034 transitions. [2018-10-26 19:18:10,002 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2034 transitions. Word has length 163 [2018-10-26 19:18:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:10,004 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 2034 transitions. [2018-10-26 19:18:10,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:18:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2034 transitions. [2018-10-26 19:18:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 19:18:10,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:10,009 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:10,010 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:10,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:10,010 INFO L82 PathProgramCache]: Analyzing trace with hash 894893843, now seen corresponding path program 1 times [2018-10-26 19:18:10,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:10,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:10,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:10,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:10,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:18:10,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:18:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:18:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:18:10,252 INFO L87 Difference]: Start difference. First operand 1485 states and 2034 transitions. Second operand 6 states. [2018-10-26 19:18:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:11,083 INFO L93 Difference]: Finished difference Result 3547 states and 5008 transitions. [2018-10-26 19:18:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:18:11,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2018-10-26 19:18:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:11,093 INFO L225 Difference]: With dead ends: 3547 [2018-10-26 19:18:11,093 INFO L226 Difference]: Without dead ends: 2068 [2018-10-26 19:18:11,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:18:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2018-10-26 19:18:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2051. [2018-10-26 19:18:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-10-26 19:18:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2708 transitions. [2018-10-26 19:18:11,141 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2708 transitions. Word has length 169 [2018-10-26 19:18:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:11,141 INFO L481 AbstractCegarLoop]: Abstraction has 2051 states and 2708 transitions. [2018-10-26 19:18:11,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:18:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2708 transitions. [2018-10-26 19:18:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 19:18:11,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:11,147 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:11,147 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:11,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1544642997, now seen corresponding path program 1 times [2018-10-26 19:18:11,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:11,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:11,453 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:18:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-26 19:18:11,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:18:11,510 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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-10-26 19:18:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:11,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:18:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:12,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:18:12,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-10-26 19:18:12,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:18:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:18:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:18:12,085 INFO L87 Difference]: Start difference. First operand 2051 states and 2708 transitions. Second operand 11 states. [2018-10-26 19:18:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:16,247 INFO L93 Difference]: Finished difference Result 5282 states and 7182 transitions. [2018-10-26 19:18:16,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 19:18:16,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 243 [2018-10-26 19:18:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:16,254 INFO L225 Difference]: With dead ends: 5282 [2018-10-26 19:18:16,254 INFO L226 Difference]: Without dead ends: 1645 [2018-10-26 19:18:16,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-10-26 19:18:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-10-26 19:18:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1200. [2018-10-26 19:18:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-10-26 19:18:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1360 transitions. [2018-10-26 19:18:16,293 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1360 transitions. Word has length 243 [2018-10-26 19:18:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:16,293 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 1360 transitions. [2018-10-26 19:18:16,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:18:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1360 transitions. [2018-10-26 19:18:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-26 19:18:16,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:16,297 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:16,298 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:16,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash -740251601, now seen corresponding path program 1 times [2018-10-26 19:18:16,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:16,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:16,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:16,735 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 19:18:16,954 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 19:18:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 112 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:17,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:18:17,363 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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-10-26 19:18:17,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:17,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:18:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 19:18:17,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:18:17,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 17 [2018-10-26 19:18:17,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 19:18:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 19:18:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-26 19:18:17,848 INFO L87 Difference]: Start difference. First operand 1200 states and 1360 transitions. Second operand 17 states. [2018-10-26 19:18:17,998 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-10-26 19:18:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:22,447 INFO L93 Difference]: Finished difference Result 4397 states and 5221 transitions. [2018-10-26 19:18:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-26 19:18:22,447 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 257 [2018-10-26 19:18:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:22,456 INFO L225 Difference]: With dead ends: 4397 [2018-10-26 19:18:22,456 INFO L226 Difference]: Without dead ends: 2771 [2018-10-26 19:18:22,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=846, Invalid=2814, Unknown=0, NotChecked=0, Total=3660 [2018-10-26 19:18:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2018-10-26 19:18:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2221. [2018-10-26 19:18:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2018-10-26 19:18:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 2581 transitions. [2018-10-26 19:18:22,517 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 2581 transitions. Word has length 257 [2018-10-26 19:18:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:22,517 INFO L481 AbstractCegarLoop]: Abstraction has 2221 states and 2581 transitions. [2018-10-26 19:18:22,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 19:18:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2581 transitions. [2018-10-26 19:18:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-26 19:18:22,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:22,525 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:18:22,525 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:22,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2092867885, now seen corresponding path program 1 times [2018-10-26 19:18:22,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:22,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:22,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:22,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 19:18:22,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:18:22,876 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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-10-26 19:18:22,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:22,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:18:23,460 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 27 [2018-10-26 19:18:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 37 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 19:18:23,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:18:23,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-10-26 19:18:23,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:18:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:18:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:18:23,648 INFO L87 Difference]: Start difference. First operand 2221 states and 2581 transitions. Second operand 11 states. [2018-10-26 19:18:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:26,950 INFO L93 Difference]: Finished difference Result 6689 states and 8080 transitions. [2018-10-26 19:18:26,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-26 19:18:26,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2018-10-26 19:18:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:26,964 INFO L225 Difference]: With dead ends: 6689 [2018-10-26 19:18:26,965 INFO L226 Difference]: Without dead ends: 4618 [2018-10-26 19:18:26,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2018-10-26 19:18:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2018-10-26 19:18:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 3503. [2018-10-26 19:18:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-10-26 19:18:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4021 transitions. [2018-10-26 19:18:27,067 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4021 transitions. Word has length 279 [2018-10-26 19:18:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:27,068 INFO L481 AbstractCegarLoop]: Abstraction has 3503 states and 4021 transitions. [2018-10-26 19:18:27,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:18:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4021 transitions. [2018-10-26 19:18:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-26 19:18:27,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:27,076 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:27,076 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:27,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:27,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1969764932, now seen corresponding path program 1 times [2018-10-26 19:18:27,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:27,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:27,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:27,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:27,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 38 proven. 124 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:18:27,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:18:27,302 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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-10-26 19:18:27,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:27,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:18:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 19:18:27,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:18:27,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-10-26 19:18:27,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:18:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:18:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:18:27,599 INFO L87 Difference]: Start difference. First operand 3503 states and 4021 transitions. Second operand 6 states. [2018-10-26 19:18:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:28,784 INFO L93 Difference]: Finished difference Result 7168 states and 8275 transitions. [2018-10-26 19:18:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:18:28,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 292 [2018-10-26 19:18:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:28,794 INFO L225 Difference]: With dead ends: 7168 [2018-10-26 19:18:28,795 INFO L226 Difference]: Without dead ends: 3671 [2018-10-26 19:18:28,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:18:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2018-10-26 19:18:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3501. [2018-10-26 19:18:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3501 states. [2018-10-26 19:18:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4010 transitions. [2018-10-26 19:18:28,877 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4010 transitions. Word has length 292 [2018-10-26 19:18:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:28,877 INFO L481 AbstractCegarLoop]: Abstraction has 3501 states and 4010 transitions. [2018-10-26 19:18:28,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:18:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4010 transitions. [2018-10-26 19:18:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-26 19:18:28,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:28,885 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:28,885 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:28,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2077934680, now seen corresponding path program 1 times [2018-10-26 19:18:28,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:29,163 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 19:18:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 38 proven. 126 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:18:29,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:18:29,597 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/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-10-26 19:18:29,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:29,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:18:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 19:18:29,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:18:29,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-10-26 19:18:29,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:18:29,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:18:29,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:18:29,796 INFO L87 Difference]: Start difference. First operand 3501 states and 4010 transitions. Second operand 9 states. [2018-10-26 19:18:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:30,638 INFO L93 Difference]: Finished difference Result 7014 states and 8072 transitions. [2018-10-26 19:18:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 19:18:30,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 294 [2018-10-26 19:18:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:30,648 INFO L225 Difference]: With dead ends: 7014 [2018-10-26 19:18:30,649 INFO L226 Difference]: Without dead ends: 3663 [2018-10-26 19:18:30,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-10-26 19:18:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2018-10-26 19:18:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 3371. [2018-10-26 19:18:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2018-10-26 19:18:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 3777 transitions. [2018-10-26 19:18:30,720 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 3777 transitions. Word has length 294 [2018-10-26 19:18:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:30,720 INFO L481 AbstractCegarLoop]: Abstraction has 3371 states and 3777 transitions. [2018-10-26 19:18:30,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:18:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 3777 transitions. [2018-10-26 19:18:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-26 19:18:30,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:30,728 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:18:30,728 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:30,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1971312289, now seen corresponding path program 1 times [2018-10-26 19:18:30,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:30,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:18:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:18:30,860 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 19:18:30,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:18:30 BoogieIcfgContainer [2018-10-26 19:18:30,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:18:30,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:18:30,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:18:30,980 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:18:30,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:18:02" (3/4) ... [2018-10-26 19:18:30,983 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 19:18:31,137 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f00b396a-a360-4db1-bf7e-a4da32a5ce6a/bin-2019/uautomizer/witness.graphml [2018-10-26 19:18:31,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:18:31,138 INFO L168 Benchmark]: Toolchain (without parser) took 31417.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.0 MB). Free memory was 951.8 MB in the beginning and 1.0 GB in the end (delta: -94.1 MB). Peak memory consumption was 325.9 MB. Max. memory is 11.5 GB. [2018-10-26 19:18:31,139 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:18:31,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 19:18:31,139 INFO L168 Benchmark]: Boogie Preprocessor took 180.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -227.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:18:31,139 INFO L168 Benchmark]: RCFGBuilder took 2468.55 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.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:18:31,139 INFO L168 Benchmark]: TraceAbstraction took 28118.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -30.1 MB). Peak memory consumption was 234.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:18:31,140 INFO L168 Benchmark]: Witness Printer took 158.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:18:31,141 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 487.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 180.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -227.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2468.55 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.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28118.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -30.1 MB). Peak memory consumption was 234.2 MB. Max. memory is 11.5 GB. * Witness Printer took 158.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 61]: 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)=171, \old(a10)=175, \old(a12)=179, \old(a19)=172, \old(a4)=176, \old(inputB)=178, \old(inputC)=177, \old(inputD)=173, \old(inputE)=170, \old(inputF)=174, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] RET return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=25, a1=169, a10=1, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=169, a10=1, a12=0, a19=9, a4=14, calculate_output(input)=25, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, a1=169, a10=1, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND TRUE ((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0))))) [L535] a1 = (((a1 + -438195) * 1) * 1) [L536] a10 = 2 [L537] a19 = 8 [L539] RET return -1; VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=5, \result=-1, a1=-438026, a10=2, a12=0, a19=8, 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=-438026, a10=2, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND TRUE (((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] __VERIFIER_error() VAL [\old(a1)=-438026, \old(a10)=2, \old(a19)=8, \old(input)=3, a1=-438026, a10=2, a12=0, a19=8, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 28.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 709 SDtfs, 11206 SDslu, 1297 SDs, 0 SdLazy, 16624 SolverSat, 2706 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1572 GetRequests, 1405 SyntacticMatches, 13 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3503occurred in iteration=8, 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.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 2638 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 3595 NumberOfCodeBlocks, 3595 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3279 ConstructedInterpolants, 2 QuantifiedInterpolants, 3960024 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2238 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1178/1544 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...