./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:19:58,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:19:58,479 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:19:58,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:19:58,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:19:58,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:19:58,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:19:58,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:19:58,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:19:58,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:19:58,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:19:58,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:19:58,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:19:58,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:19:58,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:19:58,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:19:58,544 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:19:58,544 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:19:58,545 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:19:58,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:19:58,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:19:58,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:19:58,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:19:58,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:19:58,545 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:19:58,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:19:58,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 [2024-11-25 03:19:58,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:19:58,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:19:58,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:19:58,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:19:58,971 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:19:58,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2024-11-25 03:20:02,255 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/data/8d65fc838/118222163f864a7582add1805ae9dc4a/FLAGb1e781719 [2024-11-25 03:20:02,744 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:20:02,745 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2024-11-25 03:20:02,762 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/data/8d65fc838/118222163f864a7582add1805ae9dc4a/FLAGb1e781719 [2024-11-25 03:20:02,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/data/8d65fc838/118222163f864a7582add1805ae9dc4a [2024-11-25 03:20:02,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:20:02,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:20:02,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:20:02,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:20:02,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:20:02,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:20:02" (1/1) ... [2024-11-25 03:20:02,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209cb4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:02, skipping insertion in model container [2024-11-25 03:20:02,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:20:02" (1/1) ... [2024-11-25 03:20:02,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:20:03,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2024-11-25 03:20:03,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:20:03,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:20:03,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2024-11-25 03:20:03,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:20:03,481 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:20:03,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03 WrapperNode [2024-11-25 03:20:03,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:20:03,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:20:03,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:20:03,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:20:03,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,556 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 03:20:03,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:20:03,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:20:03,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:20:03,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:20:03,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:20:03,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:20:03,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:20:03,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:20:03,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:20:03" (1/1) ... [2024-11-25 03:20:03,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:20:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:20:03,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:20:03,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:20:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:20:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:20:03,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:20:03,791 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:20:03,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:20:05,335 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 03:20:05,337 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:20:05,693 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:20:05,694 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:20:05,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:20:05 BoogieIcfgContainer [2024-11-25 03:20:05,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:20:05,697 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:20:05,697 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:20:05,709 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:20:05,709 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:20:05" (1/1) ... [2024-11-25 03:20:05,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:20:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 03:20:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 03:20:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 03:20:05,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-11-25 03:20:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-11-25 03:20:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 03:20:07,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-11-25 03:20:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-11-25 03:20:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 03:20:08,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-11-25 03:20:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-11-25 03:20:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 03:20:08,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:08,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:20:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2024-11-25 03:20:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-11-25 03:20:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 03:20:09,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2024-11-25 03:20:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2024-11-25 03:20:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 03:20:10,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2024-11-25 03:20:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2024-11-25 03:20:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:20:10,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:20:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2024-11-25 03:20:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-11-25 03:20:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 03:20:11,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 343 states and 489 transitions. [2024-11-25 03:20:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 489 transitions. [2024-11-25 03:20:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 03:20:12,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 353 states and 500 transitions. [2024-11-25 03:20:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2024-11-25 03:20:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 03:20:13,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:13,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2024-11-25 03:20:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-11-25 03:20:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 03:20:13,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:20:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 365 states and 512 transitions. [2024-11-25 03:20:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-11-25 03:20:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:20:13,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:13,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 373 states and 525 transitions. [2024-11-25 03:20:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 525 transitions. [2024-11-25 03:20:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-25 03:20:14,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 382 states and 537 transitions. [2024-11-25 03:20:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 537 transitions. [2024-11-25 03:20:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-25 03:20:14,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2024-11-25 03:20:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2024-11-25 03:20:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-25 03:20:15,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-11-25 03:20:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-11-25 03:20:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 03:20:15,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 398 states and 556 transitions. [2024-11-25 03:20:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2024-11-25 03:20:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 03:20:16,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:16,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 400 states and 558 transitions. [2024-11-25 03:20:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 558 transitions. [2024-11-25 03:20:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 03:20:16,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 402 states and 560 transitions. [2024-11-25 03:20:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2024-11-25 03:20:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:20:16,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 407 states and 568 transitions. [2024-11-25 03:20:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2024-11-25 03:20:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:20:17,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 417 states and 579 transitions. [2024-11-25 03:20:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 579 transitions. [2024-11-25 03:20:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:20:18,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 423 states and 585 transitions. [2024-11-25 03:20:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 585 transitions. [2024-11-25 03:20:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:20:18,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 440 states and 604 transitions. [2024-11-25 03:20:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 604 transitions. [2024-11-25 03:20:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-25 03:20:19,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:20:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 454 states and 618 transitions. [2024-11-25 03:20:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2024-11-25 03:20:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 03:20:19,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:20:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 478 states and 645 transitions. [2024-11-25 03:20:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 645 transitions. [2024-11-25 03:20:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 03:20:21,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:21,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:20:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 507 states and 679 transitions. [2024-11-25 03:20:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 679 transitions. [2024-11-25 03:20:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-25 03:20:22,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 536 states and 709 transitions. [2024-11-25 03:20:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 709 transitions. [2024-11-25 03:20:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-25 03:20:22,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:20:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 584 states and 761 transitions. [2024-11-25 03:20:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 761 transitions. [2024-11-25 03:20:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-25 03:20:23,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:23,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2024-11-25 03:20:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2024-11-25 03:20:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-25 03:20:24,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-25 03:20:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 627 states and 807 transitions. [2024-11-25 03:20:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 807 transitions. [2024-11-25 03:20:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-25 03:20:25,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 638 states and 821 transitions. [2024-11-25 03:20:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 821 transitions. [2024-11-25 03:20:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-25 03:20:26,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 648 states and 832 transitions. [2024-11-25 03:20:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 832 transitions. [2024-11-25 03:20:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-25 03:20:27,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:27,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-25 03:20:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 662 states and 848 transitions. [2024-11-25 03:20:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 848 transitions. [2024-11-25 03:20:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 03:20:28,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 701 states and 891 transitions. [2024-11-25 03:20:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 891 transitions. [2024-11-25 03:20:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:20:29,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 771 states and 969 transitions. [2024-11-25 03:20:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 969 transitions. [2024-11-25 03:20:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:20:30,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:30,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 840 states and 1059 transitions. [2024-11-25 03:20:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1059 transitions. [2024-11-25 03:20:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:20:33,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 908 states and 1131 transitions. [2024-11-25 03:20:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1131 transitions. [2024-11-25 03:20:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 03:20:35,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 03:20:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 909 states and 1131 transitions. [2024-11-25 03:20:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1131 transitions. [2024-11-25 03:20:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 03:20:36,325 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:36,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 937 states and 1161 transitions. [2024-11-25 03:20:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1161 transitions. [2024-11-25 03:20:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:20:37,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 977 states and 1210 transitions. [2024-11-25 03:20:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1210 transitions. [2024-11-25 03:20:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:20:39,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1016 states and 1252 transitions. [2024-11-25 03:20:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1252 transitions. [2024-11-25 03:20:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:20:40,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1087 states and 1323 transitions. [2024-11-25 03:20:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1323 transitions. [2024-11-25 03:20:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 03:20:42,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:42,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1106 states and 1344 transitions. [2024-11-25 03:20:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1344 transitions. [2024-11-25 03:20:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 03:20:43,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1123 states and 1364 transitions. [2024-11-25 03:20:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1364 transitions. [2024-11-25 03:20:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 03:20:44,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 97 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:20:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1154 states and 1406 transitions. [2024-11-25 03:20:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1406 transitions. [2024-11-25 03:20:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 03:20:47,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:47,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-25 03:20:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1157 states and 1411 transitions. [2024-11-25 03:20:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1411 transitions. [2024-11-25 03:20:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-25 03:20:48,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1176 states and 1432 transitions. [2024-11-25 03:20:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1432 transitions. [2024-11-25 03:20:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-25 03:20:49,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1195 states and 1455 transitions. [2024-11-25 03:20:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1455 transitions. [2024-11-25 03:20:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-25 03:20:50,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1197 states and 1457 transitions. [2024-11-25 03:20:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1457 transitions. [2024-11-25 03:20:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-25 03:20:51,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 03:20:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1213 states and 1477 transitions. [2024-11-25 03:20:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1477 transitions. [2024-11-25 03:20:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-25 03:20:51,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1224 states and 1490 transitions. [2024-11-25 03:20:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1490 transitions. [2024-11-25 03:20:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-25 03:20:52,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-25 03:20:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1228 states and 1494 transitions. [2024-11-25 03:20:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1494 transitions. [2024-11-25 03:20:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 03:20:53,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:20:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1249 states and 1520 transitions. [2024-11-25 03:20:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1520 transitions. [2024-11-25 03:20:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-25 03:20:54,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 03:20:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1290 states and 1566 transitions. [2024-11-25 03:20:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1566 transitions. [2024-11-25 03:20:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:20:56,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1323 states and 1607 transitions. [2024-11-25 03:20:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1607 transitions. [2024-11-25 03:20:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:20:58,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:58,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:20:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:20:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:20:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1335 states and 1622 transitions. [2024-11-25 03:20:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1622 transitions. [2024-11-25 03:20:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:20:59,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:20:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:20:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1354 states and 1643 transitions. [2024-11-25 03:21:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1643 transitions. [2024-11-25 03:21:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:21:01,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1358 states and 1647 transitions. [2024-11-25 03:21:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1647 transitions. [2024-11-25 03:21:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 03:21:02,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:21:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1374 states and 1664 transitions. [2024-11-25 03:21:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1664 transitions. [2024-11-25 03:21:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 03:21:02,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:21:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1375 states and 1667 transitions. [2024-11-25 03:21:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1667 transitions. [2024-11-25 03:21:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 03:21:03,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:21:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1378 states and 1670 transitions. [2024-11-25 03:21:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1670 transitions. [2024-11-25 03:21:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-25 03:21:03,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 03:21:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1403 states and 1696 transitions. [2024-11-25 03:21:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1696 transitions. [2024-11-25 03:21:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:21:04,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1449 states and 1755 transitions. [2024-11-25 03:21:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1755 transitions. [2024-11-25 03:21:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:21:08,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1478 states and 1795 transitions. [2024-11-25 03:21:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1795 transitions. [2024-11-25 03:21:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:21:11,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1495 states and 1812 transitions. [2024-11-25 03:21:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1812 transitions. [2024-11-25 03:21:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:21:12,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1510 states and 1826 transitions. [2024-11-25 03:21:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1826 transitions. [2024-11-25 03:21:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:21:13,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1512 states and 1828 transitions. [2024-11-25 03:21:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1828 transitions. [2024-11-25 03:21:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:21:13,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1514 states and 1829 transitions. [2024-11-25 03:21:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1829 transitions. [2024-11-25 03:21:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-25 03:21:14,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 03:21:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1531 states and 1849 transitions. [2024-11-25 03:21:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1849 transitions. [2024-11-25 03:21:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-25 03:21:15,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 03:21:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1563 states and 1888 transitions. [2024-11-25 03:21:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1888 transitions. [2024-11-25 03:21:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 03:21:16,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 03:21:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1564 states and 1889 transitions. [2024-11-25 03:21:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1889 transitions. [2024-11-25 03:21:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 03:21:17,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:21:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1593 states and 1922 transitions. [2024-11-25 03:21:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1922 transitions. [2024-11-25 03:21:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:21:18,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 03:21:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1610 states and 1940 transitions. [2024-11-25 03:21:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1940 transitions. [2024-11-25 03:21:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:21:19,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 03:21:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1629 states and 1959 transitions. [2024-11-25 03:21:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1959 transitions. [2024-11-25 03:21:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:21:21,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 03:21:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1631 states and 1960 transitions. [2024-11-25 03:21:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1960 transitions. [2024-11-25 03:21:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:21:21,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 03:21:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1640 states and 1969 transitions. [2024-11-25 03:21:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1969 transitions. [2024-11-25 03:21:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:21:22,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:22,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1655 states and 1989 transitions. [2024-11-25 03:21:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1989 transitions. [2024-11-25 03:21:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:21:25,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:25,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 1677 states and 2012 transitions. [2024-11-25 03:21:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2012 transitions. [2024-11-25 03:21:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:21:27,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 1696 states and 2032 transitions. [2024-11-25 03:21:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2032 transitions. [2024-11-25 03:21:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-25 03:21:28,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 03:21:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1713 states and 2054 transitions. [2024-11-25 03:21:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2054 transitions. [2024-11-25 03:21:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-25 03:21:30,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 03:21:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1747 states and 2095 transitions. [2024-11-25 03:21:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2095 transitions. [2024-11-25 03:21:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:21:32,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 03:21:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1754 states and 2102 transitions. [2024-11-25 03:21:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2102 transitions. [2024-11-25 03:21:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:21:33,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:33,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:21:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 1803 states and 2157 transitions. [2024-11-25 03:21:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2157 transitions. [2024-11-25 03:21:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:21:37,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:21:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 1827 states and 2182 transitions. [2024-11-25 03:21:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2182 transitions. [2024-11-25 03:21:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:21:39,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 03:21:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 1869 states and 2228 transitions. [2024-11-25 03:21:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2228 transitions. [2024-11-25 03:21:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:21:42,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 03:21:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1872 states and 2232 transitions. [2024-11-25 03:21:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2232 transitions. [2024-11-25 03:21:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:21:42,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:21:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1890 states and 2255 transitions. [2024-11-25 03:21:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2255 transitions. [2024-11-25 03:21:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:21:45,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:45,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:21:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 1941 states and 2309 transitions. [2024-11-25 03:21:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2309 transitions. [2024-11-25 03:21:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:21:49,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1954 states and 2325 transitions. [2024-11-25 03:21:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2325 transitions. [2024-11-25 03:21:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:21:52,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:21:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:21:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 1961 states and 2331 transitions. [2024-11-25 03:21:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2331 transitions. [2024-11-25 03:21:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:21:54,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:21:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:21:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:21:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:22:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2025 states and 2402 transitions. [2024-11-25 03:22:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2402 transitions. [2024-11-25 03:22:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:22:01,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:22:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2088 states and 2474 transitions. [2024-11-25 03:22:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2474 transitions. [2024-11-25 03:22:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 03:22:06,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 147 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:22:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2094 states and 2482 transitions. [2024-11-25 03:22:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2482 transitions. [2024-11-25 03:22:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 03:22:09,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 147 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:22:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2096 states and 2484 transitions. [2024-11-25 03:22:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2484 transitions. [2024-11-25 03:22:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 03:22:10,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 58 proven. 202 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 03:22:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2183 states and 2575 transitions. [2024-11-25 03:22:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2575 transitions. [2024-11-25 03:22:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 03:22:13,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-25 03:22:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2253 states and 2647 transitions. [2024-11-25 03:22:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2647 transitions. [2024-11-25 03:22:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-25 03:22:14,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-25 03:22:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2255 states and 2649 transitions. [2024-11-25 03:22:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2649 transitions. [2024-11-25 03:22:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 03:22:15,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 03:22:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2291 states and 2698 transitions. [2024-11-25 03:22:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2698 transitions. [2024-11-25 03:22:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 03:22:22,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 03:22:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2320 states and 2733 transitions. [2024-11-25 03:22:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 2733 transitions. [2024-11-25 03:22:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 03:22:24,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 03:22:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2325 states and 2739 transitions. [2024-11-25 03:22:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 2739 transitions. [2024-11-25 03:22:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 03:22:25,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 03:22:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2339 states and 2756 transitions. [2024-11-25 03:22:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 2756 transitions. [2024-11-25 03:22:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 03:22:26,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-25 03:22:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2413 states and 2832 transitions. [2024-11-25 03:22:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 2832 transitions. [2024-11-25 03:22:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:22:27,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:22:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2514 states and 2962 transitions. [2024-11-25 03:22:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2962 transitions. [2024-11-25 03:22:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:22:37,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:22:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 2566 states and 3023 transitions. [2024-11-25 03:22:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3023 transitions. [2024-11-25 03:22:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 03:22:41,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:22:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-25 03:22:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:22:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 2567 states and 3023 transitions. [2024-11-25 03:22:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3023 transitions. [2024-11-25 03:22:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 03:22:41,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:22:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:22:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:22:41,796 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:22:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:22:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:22:42,141 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:22:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:22:42,380 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 105 iterations. [2024-11-25 03:22:42,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:22:42 ImpRootNode [2024-11-25 03:22:42,624 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:22:42,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:22:42,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:22:42,625 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:22:42,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:20:05" (3/4) ... [2024-11-25 03:22:42,628 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 03:22:42,923 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 282. [2024-11-25 03:22:43,169 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:22:43,170 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:22:43,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:22:43,171 INFO L158 Benchmark]: Toolchain (without parser) took 160384.13ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 104.6MB in the beginning and 648.0MB in the end (delta: -543.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-25 03:22:43,171 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:22:43,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.91ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 77.5MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:22:43,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.71ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 72.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:22:43,172 INFO L158 Benchmark]: Boogie Preprocessor took 63.52ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 68.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:22:43,173 INFO L158 Benchmark]: RCFGBuilder took 2072.28ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 66.5MB in the end (delta: 1.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-25 03:22:43,173 INFO L158 Benchmark]: CodeCheck took 156927.21ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 66.5MB in the beginning and 694.2MB in the end (delta: -627.6MB). Peak memory consumption was 975.1MB. Max. memory is 16.1GB. [2024-11-25 03:22:43,173 INFO L158 Benchmark]: Witness Printer took 545.32ms. Allocated memory is still 1.7GB. Free memory was 694.2MB in the beginning and 648.0MB in the end (delta: 46.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-25 03:22:43,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 156.6s, OverallIterations: 105, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257114 SdHoareTripleChecker+Valid, 863.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255573 mSDsluCounter, 42588 SdHoareTripleChecker+Invalid, 734.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36158 mSDsCounter, 86677 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582534 IncrementalHoareTripleChecker+Invalid, 669211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86677 mSolverCounterUnsat, 6430 mSDtfsCounter, 582534 mSolverCounterSat, 9.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116728 GetRequests, 111617 SyntacticMatches, 4175 SemanticMatches, 936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626314 ImplicationChecksByTransitivity, 105.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 17482 NumberOfCodeBlocks, 17482 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 17095 ConstructedInterpolants, 0 QuantifiedInterpolants, 92336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 104 InterpolantComputations, 38 PerfectInterpolantSequences, 14067/16611 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 402]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L272] a16 = 4 [L273] a20 = 0 [L274] return 25; VAL [\result=25, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L249] a20 = 0 [L250] a21 = 1 [L251] a17 = 0 [L252] a8 = 14 [L253] a16 = 4 [L254] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.91ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 77.5MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.71ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 72.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.52ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 68.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2072.28ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 66.5MB in the end (delta: 1.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * CodeCheck took 156927.21ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 66.5MB in the beginning and 694.2MB in the end (delta: -627.6MB). Peak memory consumption was 975.1MB. Max. memory is 16.1GB. * Witness Printer took 545.32ms. Allocated memory is still 1.7GB. Free memory was 694.2MB in the beginning and 648.0MB in the end (delta: 46.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 03:22:43,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81db0d3-418f-41af-a787-1b7d6c6ec103/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE