./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label15.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_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label15.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b --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 ed249da04373d4759cadf5f52529e2266bc29efebb28f8cb64ff404bc3283b78 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:35:31,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:35:31,531 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 04:35:31,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:35:31,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:35:31,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:35:31,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:35:31,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:35:31,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:35:31,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:35:31,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:35:31,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 04:35:31,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:35:31,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:35:31,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:35:31,559 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:35:31,559 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:35:31,559 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:35:31,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:35:31,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:35:31,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:35:31,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:35:31,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:35:31,560 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:35:31,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:35:31,560 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_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b 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 -> ed249da04373d4759cadf5f52529e2266bc29efebb28f8cb64ff404bc3283b78 [2024-12-06 04:35:31,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:35:31,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:35:31,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:35:31,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:35:31,828 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:35:31,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label15.c [2024-12-06 04:35:34,561 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/data/d3168cb28/2f67b104a13b40d998e6c67d5ce48056/FLAG81247ce95 [2024-12-06 04:35:34,819 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:35:34,820 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/sv-benchmarks/c/eca-rers2012/Problem01_label15.c [2024-12-06 04:35:34,831 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/data/d3168cb28/2f67b104a13b40d998e6c67d5ce48056/FLAG81247ce95 [2024-12-06 04:35:35,126 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/data/d3168cb28/2f67b104a13b40d998e6c67d5ce48056 [2024-12-06 04:35:35,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:35:35,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:35:35,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:35:35,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:35:35,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:35:35,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8555ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35, skipping insertion in model container [2024-12-06 04:35:35,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:35:35,398 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_37c8c05a-cd89-484b-956b-6944c9538a18/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] [2024-12-06 04:35:35,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:35:35,438 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:35:35,497 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_37c8c05a-cd89-484b-956b-6944c9538a18/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] [2024-12-06 04:35:35,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:35:35,527 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:35:35,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35 WrapperNode [2024-12-06 04:35:35,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:35:35,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:35:35,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:35:35,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:35:35,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,582 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 04:35:35,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:35:35,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:35:35,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:35:35,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:35:35,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:35:35,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:35:35,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:35:35,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:35:35,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:35" (1/1) ... [2024-12-06 04:35:35,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:35:35,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:35:35,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:35:35,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:35:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 04:35:35,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 04:35:35,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:35:35,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:35:35,765 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:35:35,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:35:36,566 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 04:35:36,567 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:35:36,804 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:35:36,804 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 04:35:36,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:36 BoogieIcfgContainer [2024-12-06 04:35:36,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:35:36,805 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:35:36,806 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:35:36,815 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:35:36,815 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:36" (1/1) ... [2024-12-06 04:35:36,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:35:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 04:35:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 04:35:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 04:35:36,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-12-06 04:35:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-12-06 04:35:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 04:35:37,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-12-06 04:35:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-12-06 04:35:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 04:35:38,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-12-06 04:35:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-12-06 04:35:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 04:35:38,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 290 states and 430 transitions. [2024-12-06 04:35:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 430 transitions. [2024-12-06 04:35:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 04:35:39,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 300 states and 443 transitions. [2024-12-06 04:35:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2024-12-06 04:35:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 04:35:39,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 306 states and 452 transitions. [2024-12-06 04:35:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 452 transitions. [2024-12-06 04:35:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 04:35:40,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 316 states and 463 transitions. [2024-12-06 04:35:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 463 transitions. [2024-12-06 04:35:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 04:35:40,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 321 states and 468 transitions. [2024-12-06 04:35:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 468 transitions. [2024-12-06 04:35:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 04:35:40,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:35:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 332 states and 481 transitions. [2024-12-06 04:35:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 481 transitions. [2024-12-06 04:35:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 04:35:41,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2024-12-06 04:35:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2024-12-06 04:35:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 04:35:41,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 349 states and 506 transitions. [2024-12-06 04:35:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 506 transitions. [2024-12-06 04:35:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 04:35:41,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:41,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 354 states and 512 transitions. [2024-12-06 04:35:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 512 transitions. [2024-12-06 04:35:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 04:35:42,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 356 states and 514 transitions. [2024-12-06 04:35:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 514 transitions. [2024-12-06 04:35:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 04:35:42,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:35:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 376 states and 537 transitions. [2024-12-06 04:35:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 537 transitions. [2024-12-06 04:35:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 04:35:42,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 384 states and 547 transitions. [2024-12-06 04:35:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 547 transitions. [2024-12-06 04:35:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 04:35:43,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 386 states and 549 transitions. [2024-12-06 04:35:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 549 transitions. [2024-12-06 04:35:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 04:35:43,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 388 states and 551 transitions. [2024-12-06 04:35:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 551 transitions. [2024-12-06 04:35:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 04:35:43,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 394 states and 560 transitions. [2024-12-06 04:35:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 560 transitions. [2024-12-06 04:35:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 04:35:44,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 404 states and 571 transitions. [2024-12-06 04:35:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 571 transitions. [2024-12-06 04:35:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 04:35:44,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 409 states and 576 transitions. [2024-12-06 04:35:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 576 transitions. [2024-12-06 04:35:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 04:35:44,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 426 states and 595 transitions. [2024-12-06 04:35:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 595 transitions. [2024-12-06 04:35:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 04:35:45,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:45,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:35:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 449 states and 621 transitions. [2024-12-06 04:35:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 621 transitions. [2024-12-06 04:35:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 04:35:45,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:35:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 478 states and 655 transitions. [2024-12-06 04:35:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 655 transitions. [2024-12-06 04:35:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 04:35:46,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:35:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 497 states and 675 transitions. [2024-12-06 04:35:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 675 transitions. [2024-12-06 04:35:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 04:35:46,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 511 states and 689 transitions. [2024-12-06 04:35:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 689 transitions. [2024-12-06 04:35:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 04:35:46,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 522 states and 703 transitions. [2024-12-06 04:35:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 703 transitions. [2024-12-06 04:35:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 04:35:47,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:47,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 532 states and 714 transitions. [2024-12-06 04:35:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 714 transitions. [2024-12-06 04:35:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 04:35:47,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 04:35:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 547 states and 732 transitions. [2024-12-06 04:35:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 732 transitions. [2024-12-06 04:35:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 04:35:48,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 04:35:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 561 states and 748 transitions. [2024-12-06 04:35:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 748 transitions. [2024-12-06 04:35:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 04:35:49,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:49,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:35:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 577 states and 767 transitions. [2024-12-06 04:35:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 767 transitions. [2024-12-06 04:35:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 04:35:49,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 04:35:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 587 states and 778 transitions. [2024-12-06 04:35:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 778 transitions. [2024-12-06 04:35:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 04:35:49,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:49,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 04:35:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 588 states and 779 transitions. [2024-12-06 04:35:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 779 transitions. [2024-12-06 04:35:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 04:35:49,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 636 states and 831 transitions. [2024-12-06 04:35:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 831 transitions. [2024-12-06 04:35:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 04:35:50,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 683 states and 886 transitions. [2024-12-06 04:35:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 886 transitions. [2024-12-06 04:35:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 04:35:51,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 04:35:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 686 states and 890 transitions. [2024-12-06 04:35:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 890 transitions. [2024-12-06 04:35:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 04:35:51,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 705 states and 912 transitions. [2024-12-06 04:35:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 912 transitions. [2024-12-06 04:35:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 04:35:52,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 724 states and 932 transitions. [2024-12-06 04:35:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 932 transitions. [2024-12-06 04:35:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 04:35:53,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 04:35:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 741 states and 950 transitions. [2024-12-06 04:35:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 950 transitions. [2024-12-06 04:35:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 04:35:53,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 04:35:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 760 states and 970 transitions. [2024-12-06 04:35:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 970 transitions. [2024-12-06 04:35:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 04:35:54,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 04:35:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 789 states and 1000 transitions. [2024-12-06 04:35:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1000 transitions. [2024-12-06 04:35:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 04:35:54,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 808 states and 1018 transitions. [2024-12-06 04:35:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1018 transitions. [2024-12-06 04:35:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 04:35:55,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 827 states and 1038 transitions. [2024-12-06 04:35:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1038 transitions. [2024-12-06 04:35:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 04:35:55,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:35:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 842 states and 1055 transitions. [2024-12-06 04:35:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1055 transitions. [2024-12-06 04:35:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 04:35:56,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 881 states and 1097 transitions. [2024-12-06 04:35:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1097 transitions. [2024-12-06 04:35:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 04:35:56,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 04:35:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 897 states and 1114 transitions. [2024-12-06 04:35:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1114 transitions. [2024-12-06 04:35:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 04:35:56,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 04:35:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 914 states and 1135 transitions. [2024-12-06 04:35:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1135 transitions. [2024-12-06 04:35:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 04:35:57,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:35:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:35:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 984 states and 1213 transitions. [2024-12-06 04:35:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1213 transitions. [2024-12-06 04:35:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 04:35:58,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:35:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:35:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:35:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1053 states and 1306 transitions. [2024-12-06 04:36:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1306 transitions. [2024-12-06 04:36:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 04:36:00,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1121 states and 1381 transitions. [2024-12-06 04:36:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1381 transitions. [2024-12-06 04:36:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 04:36:02,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 04:36:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1122 states and 1381 transitions. [2024-12-06 04:36:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1381 transitions. [2024-12-06 04:36:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 04:36:02,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1150 states and 1410 transitions. [2024-12-06 04:36:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1410 transitions. [2024-12-06 04:36:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 04:36:03,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:03,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1221 states and 1481 transitions. [2024-12-06 04:36:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1481 transitions. [2024-12-06 04:36:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 04:36:04,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1238 states and 1498 transitions. [2024-12-06 04:36:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1498 transitions. [2024-12-06 04:36:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 04:36:04,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1257 states and 1516 transitions. [2024-12-06 04:36:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1516 transitions. [2024-12-06 04:36:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 04:36:05,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1259 states and 1517 transitions. [2024-12-06 04:36:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1517 transitions. [2024-12-06 04:36:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 04:36:05,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:05,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1265 states and 1524 transitions. [2024-12-06 04:36:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1524 transitions. [2024-12-06 04:36:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 04:36:06,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1275 states and 1535 transitions. [2024-12-06 04:36:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1535 transitions. [2024-12-06 04:36:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 04:36:07,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:36:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1300 states and 1561 transitions. [2024-12-06 04:36:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1561 transitions. [2024-12-06 04:36:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 04:36:08,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:36:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1338 states and 1602 transitions. [2024-12-06 04:36:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1602 transitions. [2024-12-06 04:36:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 04:36:08,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:08,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 04:36:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1339 states and 1605 transitions. [2024-12-06 04:36:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1605 transitions. [2024-12-06 04:36:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 04:36:09,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 04:36:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1364 states and 1631 transitions. [2024-12-06 04:36:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1631 transitions. [2024-12-06 04:36:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 04:36:09,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 04:36:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1388 states and 1655 transitions. [2024-12-06 04:36:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1655 transitions. [2024-12-06 04:36:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 04:36:09,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1389 states and 1657 transitions. [2024-12-06 04:36:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1657 transitions. [2024-12-06 04:36:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 04:36:10,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1401 states and 1670 transitions. [2024-12-06 04:36:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1670 transitions. [2024-12-06 04:36:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 04:36:10,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1444 states and 1724 transitions. [2024-12-06 04:36:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1724 transitions. [2024-12-06 04:36:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 04:36:12,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1455 states and 1738 transitions. [2024-12-06 04:36:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1738 transitions. [2024-12-06 04:36:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 04:36:12,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1491 states and 1780 transitions. [2024-12-06 04:36:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1780 transitions. [2024-12-06 04:36:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 04:36:13,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1520 states and 1812 transitions. [2024-12-06 04:36:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1812 transitions. [2024-12-06 04:36:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 04:36:14,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1524 states and 1816 transitions. [2024-12-06 04:36:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1816 transitions. [2024-12-06 04:36:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 04:36:14,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1608 states and 1914 transitions. [2024-12-06 04:36:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1914 transitions. [2024-12-06 04:36:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 04:36:18,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:18,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1690 states and 2005 transitions. [2024-12-06 04:36:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2005 transitions. [2024-12-06 04:36:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 04:36:21,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1741 states and 2068 transitions. [2024-12-06 04:36:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2068 transitions. [2024-12-06 04:36:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 04:36:23,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 1787 states and 2119 transitions. [2024-12-06 04:36:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2119 transitions. [2024-12-06 04:36:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 04:36:24,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1788 states and 2120 transitions. [2024-12-06 04:36:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2120 transitions. [2024-12-06 04:36:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 04:36:24,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:24,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1818 states and 2152 transitions. [2024-12-06 04:36:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2152 transitions. [2024-12-06 04:36:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 04:36:26,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:36:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 1848 states and 2186 transitions. [2024-12-06 04:36:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2186 transitions. [2024-12-06 04:36:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 04:36:27,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1910 states and 2255 transitions. [2024-12-06 04:36:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2255 transitions. [2024-12-06 04:36:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 04:36:30,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 1956 states and 2306 transitions. [2024-12-06 04:36:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2306 transitions. [2024-12-06 04:36:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 04:36:31,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:36:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 1980 states and 2332 transitions. [2024-12-06 04:36:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2332 transitions. [2024-12-06 04:36:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 04:36:32,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 04:36:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2003 states and 2358 transitions. [2024-12-06 04:36:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2358 transitions. [2024-12-06 04:36:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 04:36:33,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 04:36:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2004 states and 2359 transitions. [2024-12-06 04:36:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2359 transitions. [2024-12-06 04:36:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 04:36:33,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 04:36:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2074 states and 2431 transitions. [2024-12-06 04:36:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2431 transitions. [2024-12-06 04:36:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 04:36:34,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2121 states and 2486 transitions. [2024-12-06 04:36:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2486 transitions. [2024-12-06 04:36:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 04:36:37,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2159 states and 2528 transitions. [2024-12-06 04:36:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2528 transitions. [2024-12-06 04:36:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 04:36:38,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2195 states and 2568 transitions. [2024-12-06 04:36:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2568 transitions. [2024-12-06 04:36:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 04:36:39,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2196 states and 2570 transitions. [2024-12-06 04:36:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2570 transitions. [2024-12-06 04:36:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 04:36:40,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:40,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 04:36:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2228 states and 2608 transitions. [2024-12-06 04:36:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2608 transitions. [2024-12-06 04:36:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 04:36:42,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 04:36:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2259 states and 2642 transitions. [2024-12-06 04:36:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2642 transitions. [2024-12-06 04:36:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 04:36:44,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 04:36:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2273 states and 2657 transitions. [2024-12-06 04:36:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2657 transitions. [2024-12-06 04:36:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 04:36:45,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 04:36:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2277 states and 2661 transitions. [2024-12-06 04:36:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2661 transitions. [2024-12-06 04:36:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 04:36:46,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2312 states and 2700 transitions. [2024-12-06 04:36:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2700 transitions. [2024-12-06 04:36:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 04:36:48,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:36:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2344 states and 2736 transitions. [2024-12-06 04:36:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2736 transitions. [2024-12-06 04:36:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 04:36:50,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 04:36:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2369 states and 2768 transitions. [2024-12-06 04:36:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 2768 transitions. [2024-12-06 04:36:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 04:36:52,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 04:36:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2396 states and 2794 transitions. [2024-12-06 04:36:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 2794 transitions. [2024-12-06 04:36:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 04:36:54,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 04:36:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2406 states and 2805 transitions. [2024-12-06 04:36:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2805 transitions. [2024-12-06 04:36:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 04:36:55,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 04:36:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2427 states and 2828 transitions. [2024-12-06 04:36:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 2828 transitions. [2024-12-06 04:36:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 04:36:56,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 04:36:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:36:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2442 states and 2843 transitions. [2024-12-06 04:36:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2843 transitions. [2024-12-06 04:36:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 04:36:57,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:36:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:36:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:36:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:37:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2470 states and 2875 transitions. [2024-12-06 04:37:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2875 transitions. [2024-12-06 04:37:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 04:37:00,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:00,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:37:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2504 states and 2914 transitions. [2024-12-06 04:37:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 2914 transitions. [2024-12-06 04:37:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 04:37:02,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:37:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2506 states and 2915 transitions. [2024-12-06 04:37:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2915 transitions. [2024-12-06 04:37:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 04:37:02,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 04:37:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2570 states and 2989 transitions. [2024-12-06 04:37:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 2989 transitions. [2024-12-06 04:37:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 04:37:06,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 04:37:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 2618 states and 3042 transitions. [2024-12-06 04:37:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3042 transitions. [2024-12-06 04:37:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 04:37:10,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 04:37:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 2633 states and 3056 transitions. [2024-12-06 04:37:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3056 transitions. [2024-12-06 04:37:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 04:37:11,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:37:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 2756 states and 3203 transitions. [2024-12-06 04:37:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3203 transitions. [2024-12-06 04:37:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 04:37:17,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 04:37:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 2781 states and 3229 transitions. [2024-12-06 04:37:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3229 transitions. [2024-12-06 04:37:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 04:37:18,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:37:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:37:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:37:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 2783 states and 3230 transitions. [2024-12-06 04:37:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3230 transitions. [2024-12-06 04:37:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 04:37:19,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:37:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:37:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:37:19,283 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:37:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:37:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:37:19,502 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:37:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:37:19,600 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 107 iterations. [2024-12-06 04:37:19,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:37:19 ImpRootNode [2024-12-06 04:37:19,700 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:37:19,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:37:19,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:37:19,700 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:37:19,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:36" (3/4) ... [2024-12-06 04:37:19,702 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 04:37:19,838 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 224. [2024-12-06 04:37:19,960 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:37:19,960 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:37:19,960 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:37:19,961 INFO L158 Benchmark]: Toolchain (without parser) took 104832.09ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 115.4MB in the beginning and 986.1MB in the end (delta: -870.7MB). Peak memory consumption was 724.0MB. Max. memory is 16.1GB. [2024-12-06 04:37:19,961 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:37:19,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.24ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 88.4MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:37:19,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.50ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 82.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:37:19,962 INFO L158 Benchmark]: Boogie Preprocessor took 54.28ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 78.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:37:19,962 INFO L158 Benchmark]: RCFGBuilder took 1166.28ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 64.8MB in the end (delta: 14.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-12-06 04:37:19,963 INFO L158 Benchmark]: CodeCheck took 102894.16ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 64.8MB in the beginning and 1.0GB in the end (delta: -954.9MB). Peak memory consumption was 639.3MB. Max. memory is 16.1GB. [2024-12-06 04:37:19,963 INFO L158 Benchmark]: Witness Printer took 260.17ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 986.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-06 04:37:19,965 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: 102.8s, OverallIterations: 107, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274617 SdHoareTripleChecker+Valid, 607.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273046 mSDsluCounter, 40742 SdHoareTripleChecker+Invalid, 515.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34566 mSDsCounter, 82340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 612732 IncrementalHoareTripleChecker+Invalid, 695072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82340 mSolverCounterUnsat, 6176 mSDtfsCounter, 612732 mSolverCounterSat, 5.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113497 GetRequests, 108058 SyntacticMatches, 4515 SemanticMatches, 924 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662987 ImplicationChecksByTransitivity, 68.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 16375 NumberOfCodeBlocks, 16375 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 16053 ConstructedInterpolants, 0 QuantifiedInterpolants, 95932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 42 PerfectInterpolantSequences, 10551/12847 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: 429]: 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=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=0, 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=0, 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=0, 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=0, 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 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=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=6, a17=0, 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] [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=6, a17=0, 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] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) 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=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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==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=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=6, a17=0, 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] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) 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=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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(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=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=6, a17=0, 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] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) 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=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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [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=6, a17=0, 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] [L188] COND TRUE ((((((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)) [L189] a17 = 0 [L190] a16 = 5 [L191] a21 = 1 [L192] a8 = 14 [L193] a7 = 1 [L194] a20 = 1 [L195] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=1, 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] [L428] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=1, 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] [L429] reach_error() VAL [a12=8, a16=5, a17=0, a20=1, 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.32ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.24ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 88.4MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.50ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 82.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.28ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 78.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1166.28ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 64.8MB in the end (delta: 14.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * CodeCheck took 102894.16ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 64.8MB in the beginning and 1.0GB in the end (delta: -954.9MB). Peak memory consumption was 639.3MB. Max. memory is 16.1GB. * Witness Printer took 260.17ms. Allocated memory is still 1.7GB. Free memory was 1.0GB in the beginning and 986.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 04:37:19,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c8c05a-cd89-484b-956b-6944c9538a18/bin/ukojak-verify-CZk0znPC7b/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