./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound100.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_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/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_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/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_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/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 d87fab1dc6e9b3b1ef38291e10411689fc961abba4e105f2586cc8da9615d8a6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:43:49,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:43:49,354 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:43:49,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:43:49,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:43:49,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:43:49,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:43:49,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:43:49,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:43:49,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:43:49,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:43:49,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:43:49,379 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:43:49,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:43:49,380 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:43:49,380 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:43:49,381 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:43:49,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:43:49,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:43:49,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:43:49,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:43:49,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:43:49,381 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:43:49,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:43:49,381 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_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/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 -> d87fab1dc6e9b3b1ef38291e10411689fc961abba4e105f2586cc8da9615d8a6 [2024-12-06 05:43:49,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:43:49,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:43:49,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:43:49,602 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:43:49,603 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:43:49,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound100.c [2024-12-06 05:43:52,205 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/data/0d9331964/84eea63c4c724bf49bf9ee6b4f2628a2/FLAG6e8211e2c [2024-12-06 05:43:52,393 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:43:52,394 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound100.c [2024-12-06 05:43:52,406 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/data/0d9331964/84eea63c4c724bf49bf9ee6b4f2628a2/FLAG6e8211e2c [2024-12-06 05:43:52,786 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/data/0d9331964/84eea63c4c724bf49bf9ee6b4f2628a2 [2024-12-06 05:43:52,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:43:52,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:43:52,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:43:52,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:43:52,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:43:52,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:52,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16aea867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52, skipping insertion in model container [2024-12-06 05:43:52,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:52,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:43:52,923 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_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound100.c[1263,1276] [2024-12-06 05:43:52,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:43:52,947 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:43:52,955 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_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound100.c[1263,1276] [2024-12-06 05:43:52,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:43:52,968 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:43:52,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52 WrapperNode [2024-12-06 05:43:52,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:43:52,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:43:52,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:43:52,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:43:52,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:52,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:52,991 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-12-06 05:43:52,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:43:52,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:43:52,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:43:52,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:43:52,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:52,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:52,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:52,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:53,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:53,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:53,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:53,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:53,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:53,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:43:53,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:43:53,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:43:53,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:43:53,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:43:52" (1/1) ... [2024-12-06 05:43:53,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:43:53,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:43:53,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:43:53,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e943aa8b-ffc0-42f2-b4b0-db6e39f544a7/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:43:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:43:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:43:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:43:53,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:43:53,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 05:43:53,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 05:43:53,103 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:43:53,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:43:53,211 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-12-06 05:43:53,212 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:43:53,260 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:43:53,260 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 05:43:53,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:43:53 BoogieIcfgContainer [2024-12-06 05:43:53,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:43:53,261 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:43:53,261 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:43:53,268 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:43:53,269 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:43:53" (1/1) ... [2024-12-06 05:43:53,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:43:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 14 states and 18 transitions. [2024-12-06 05:43:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2024-12-06 05:43:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 05:43:53,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:53,436 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 05:43:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2024-12-06 05:43:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-12-06 05:43:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:43:53,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:53,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:43:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:53,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-06 05:43:53,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:43:53,613 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 05:43:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 19 states and 26 transitions. [2024-12-06 05:43:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2024-12-06 05:43:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:43:53,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:53,755 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 05:43:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 21 states and 29 transitions. [2024-12-06 05:43:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-12-06 05:43:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:43:53,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:43:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 25 states and 37 transitions. [2024-12-06 05:43:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2024-12-06 05:43:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:43:54,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:43:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:54,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 05:43:54,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:43:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:43:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 34 states and 55 transitions. [2024-12-06 05:43:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 55 transitions. [2024-12-06 05:43:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:43:56,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:43:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 38 states and 62 transitions. [2024-12-06 05:43:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 62 transitions. [2024-12-06 05:43:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 05:43:57,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:43:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:57,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-06 05:43:57,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:43:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:43:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 40 states and 70 transitions. [2024-12-06 05:43:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 70 transitions. [2024-12-06 05:43:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:43:58,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:43:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:58,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-06 05:43:58,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:44:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:44:09,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:44:11,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:44:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:44:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 44 states and 79 transitions. [2024-12-06 05:44:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2024-12-06 05:44:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:44:11,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:44:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:44:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:44:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:44:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:44:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2024-12-06 05:44:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2024-12-06 05:44:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:44:22,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:44:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:44:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:44:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:44:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:44:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 52 states and 102 transitions. [2024-12-06 05:44:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 102 transitions. [2024-12-06 05:44:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:44:47,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:44:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:44:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:44:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:44:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:44:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 54 states and 108 transitions. [2024-12-06 05:44:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 108 transitions. [2024-12-06 05:44:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:44:48,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:44:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:44:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:44:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:44:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:44:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 56 states and 112 transitions. [2024-12-06 05:44:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 112 transitions. [2024-12-06 05:44:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:44:49,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:44:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:44:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:44:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:44:49,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-12-06 05:44:49,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:44:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:45:16,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:45:19,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:45:20,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:45:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 60 states and 124 transitions. [2024-12-06 05:45:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 124 transitions. [2024-12-06 05:45:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 05:45:20,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 05:45:38,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:45:48,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:45:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 62 states and 125 transitions. [2024-12-06 05:45:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 125 transitions. [2024-12-06 05:45:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:45:56,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:46:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 66 states and 144 transitions. [2024-12-06 05:46:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 144 transitions. [2024-12-06 05:46:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:46:23,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:46:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 68 states and 147 transitions. [2024-12-06 05:46:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 147 transitions. [2024-12-06 05:46:42,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:46:42,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:46:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:42,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-12-06 05:46:42,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:47:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:48:27,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:48:29,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 05:48:35,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:48:37,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:48:39,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:48:41,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:48:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 72 states and 161 transitions. [2024-12-06 05:48:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 161 transitions. [2024-12-06 05:48:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:48:41,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:48:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:41,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-12-06 05:48:41,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:48:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:49:13,531 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 285 DAG size of output: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:49:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 76 states and 184 transitions. [2024-12-06 05:49:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 184 transitions. [2024-12-06 05:49:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:49:25,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:49:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 78 states and 187 transitions. [2024-12-06 05:49:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 187 transitions. [2024-12-06 05:49:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:49:29,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:49:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 80 states and 191 transitions. [2024-12-06 05:49:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 191 transitions. [2024-12-06 05:49:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:49:31,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:50:14,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:51:00,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 05:51:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 82 states and 194 transitions. [2024-12-06 05:51:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 194 transitions. [2024-12-06 05:51:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:51:48,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:52:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 84 states and 198 transitions. [2024-12-06 05:52:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 198 transitions. [2024-12-06 05:52:07,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:52:07,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:52:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:07,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-06 05:52:07,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:52:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:52:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 88 states and 222 transitions. [2024-12-06 05:52:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 222 transitions. [2024-12-06 05:52:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:52:53,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:53:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 92 states and 236 transitions. [2024-12-06 05:53:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 236 transitions. [2024-12-06 05:53:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:53:03,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:53:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 94 states and 254 transitions. [2024-12-06 05:53:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 254 transitions. [2024-12-06 05:53:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:53:21,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:53:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:22,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-06 05:53:22,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:55:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:55:48,792 WARN L286 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 228 DAG size of output: 210 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:56:29,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 05:56:37,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 05:56:47,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse75 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse7 (div .cse75 2)) (.cse9 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse53 (+ (- 1) .cse9)) (.cse76 (+ (- 1) .cse7))) (let ((.cse12 (div .cse76 2)) (.cse65 (div .cse76 4)) (.cse29 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse63 (div .cse75 8)) (.cse16 (div .cse75 4)) (.cse14 (= (mod .cse7 2) 1)) (.cse19 (= (mod .cse9 2) 1)) (.cse11 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse5 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse20 (div .cse53 2)) (.cse38 (div .cse53 4)) (.cse10 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse36 (div |c_ULTIMATE.start_main_~b~0#1| 8)) (.cse18 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse4 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 32))) (.cse51 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse35 (not (= (+ 1 (* .cse36 2)) .cse18))) (.cse0 (= |c_ULTIMATE.start_main_~z~0#1| 0)) (.cse21 (= |c_ULTIMATE.start_main_~z~0#1| .cse10)) (.cse40 (not (= .cse20 (+ (* .cse38 2) 1)))) (.cse27 (= (* 7 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (.cse31 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 5))) (.cse8 (not .cse5)) (.cse42 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 6))) (.cse49 (= |c_ULTIMATE.start_main_~z~0#1| .cse11)) (.cse17 (not .cse19)) (.cse15 (not .cse14)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse64 (not (= (+ (* .cse63 2) 1) .cse16))) (.cse13 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 3))) (.cse58 (+ .cse29 1)) (.cse66 (not (= .cse12 (+ (* 2 .cse65) 1)))) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse3 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse74 (* |c_ULTIMATE.start_main_~a~0#1| 16))) (and (not (and (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~b~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 31 (* |c_ULTIMATE.start_main_~y~0#1| 32))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 32)) .cse2) .cse3 .cse4)) (not (and .cse3 (or (and .cse5 .cse6 (= |c_ULTIMATE.start_main_~y~0#1| .cse7)) (and .cse8 .cse0 (= |c_ULTIMATE.start_main_~y~0#1| .cse9))) (= |c_ULTIMATE.start_main_~x~0#1| .cse10))) (not (and (= |c_ULTIMATE.start_main_~x~0#1| .cse11) (or (and (not (= .cse7 0)) .cse5 (or (and (= |c_ULTIMATE.start_main_~y~0#1| .cse12) .cse13 .cse14) (and .cse15 .cse6 (= |c_ULTIMATE.start_main_~y~0#1| .cse16)))) (and (or (and .cse17 .cse0 (= |c_ULTIMATE.start_main_~y~0#1| .cse18)) (and .cse19 (= .cse20 |c_ULTIMATE.start_main_~y~0#1|) .cse21)) .cse8)) .cse3)) (let ((.cse47 (+ (- 1) .cse18)) (.cse45 (+ .cse20 (- 1))) (.cse28 (+ (- 1) .cse12)) (.cse55 (* (- 1) .cse16)) (.cse25 (* |c_ULTIMATE.start_main_~y~0#1| 4))) (let ((.cse61 (+ .cse25 2)) (.cse39 (* |c_ULTIMATE.start_main_~y~0#1| 8)) (.cse30 (div (+ .cse55 1) 2)) (.cse56 (+ .cse12 1)) (.cse26 (div .cse28 2)) (.cse69 (+ .cse20 1)) (.cse43 (div .cse45 2)) (.cse71 (+ .cse18 1)) (.cse46 (div .cse47 2))) (let ((.cse34 (div |c_ULTIMATE.start_main_~b~0#1| 16)) (.cse48 (not (= (mod .cse46 2) 1))) (.cse50 (= (mod .cse71 2) 0)) (.cse41 (not (= (mod .cse43 2) 1))) (.cse44 (= (mod .cse69 2) 0)) (.cse23 (not (= (mod .cse26 2) 1))) (.cse24 (= (mod .cse56 2) 0)) (.cse60 (+ .cse25 3)) (.cse32 (= 0 (mod (+ .cse16 1) 2))) (.cse33 (not (= (mod .cse30 2) 1))) (.cse73 (+ .cse39 4)) (.cse37 (<= .cse36 .cse61)) (.cse52 (+ 2 .cse39)) (.cse22 (+ 7 .cse39)) (.cse62 (+ 6 .cse39))) (or (and .cse5 (or (and (= .cse12 .cse22) .cse14 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 31))) (and (= .cse22 .cse16) .cse15 (= (* |c_ULTIMATE.start_main_~a~0#1| 29) |c_ULTIMATE.start_main_~z~0#1|)))) (and .cse5 (or (and .cse23 .cse24 (<= .cse25 .cse26) .cse14 .cse27 (<= 2 .cse26) (<= (div .cse28 4) .cse29)) (and (<= (div (* (- 1) .cse30) 2) .cse29) .cse15 .cse31 (<= 1 |c_ULTIMATE.start_main_~y~0#1|) .cse32 .cse33 (<= (+ .cse25 .cse30) 0)))) (and (or (and .cse17 (<= .cse29 .cse34) .cse35 .cse0 (<= (+ (* (div (+ (- 1) .cse36) 4) 2) 2) .cse34) .cse37) (and .cse19 .cse21 (<= 4 .cse20) (<= (+ (div (+ (- 1) .cse38) 2) 1) .cse29) (<= .cse39 .cse20) .cse40)) .cse8) (and (or (and .cse19 .cse41 .cse42 (<= .cse25 .cse43) .cse44 (<= 2 .cse43) (<= (div .cse45 4) .cse29)) (and (<= .cse25 .cse46) (<= (div .cse47 4) .cse29) .cse48 (<= 2 .cse46) .cse49 .cse17 .cse50)) .cse8) (and .cse8 (or (and (<= 6 .cse18) (= .cse51 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse52 .cse18) .cse17 (<= .cse34 .cse29) .cse35) (and .cse19 (<= .cse52 .cse20) (<= 6 .cse20) (<= (div .cse53 8) .cse29) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 10)) .cse40))) (and .cse5 (or (let ((.cse54 (div (+ 3 .cse55) 4))) (and (not (= .cse54 0)) (= (mod (+ (* 3 .cse16) 3) 4) 0) (<= (mod .cse54 2) 0) .cse15 (<= 0 (+ .cse29 .cse54 1)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 13)) (<= (+ .cse29 .cse54) 0))) (let ((.cse59 (+ .cse12 (- 3)))) (let ((.cse57 (div .cse59 4))) (and (= (mod .cse56 4) 0) (<= .cse29 .cse57) (<= .cse57 .cse58) (not (= .cse57 (+ (* 2 (div .cse59 8)) 1))) .cse14 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 15)) (not (= .cse57 0))))))) (and .cse8 (or (and .cse48 .cse17 (<= .cse46 .cse60) (<= .cse61 .cse46) (= (* |c_ULTIMATE.start_main_~a~0#1| 20) |c_ULTIMATE.start_main_~z~0#1|) .cse50) (and .cse19 (<= .cse61 .cse43) .cse41 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 22)) .cse44 (<= .cse43 .cse60)))) (and (or (and .cse19 (<= .cse20 .cse22) (<= .cse62 .cse20) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 26)) .cse40) (and (= (* |c_ULTIMATE.start_main_~a~0#1| 24) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse18 .cse22) (<= .cse62 .cse18) .cse17 .cse35)) .cse8) (and .cse5 (or (and (<= .cse39 .cse16) .cse15 .cse6 (<= (+ (div (+ (- 1) .cse63) 2) 1) .cse29) (<= 4 .cse16) .cse64) (and (<= (+ (div (+ (- 1) .cse65) 2) 1) .cse29) (<= 4 .cse12) (<= .cse39 .cse12) .cse13 .cse14 .cse66))) (and (or (let ((.cse68 (+ .cse20 (- 3)))) (let ((.cse67 (div .cse68 4))) (and .cse19 (<= .cse67 .cse58) (<= .cse29 .cse67) (not (= (+ (* (div .cse68 8) 2) 1) .cse67)) (not (= .cse67 0)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 14)) (= (mod .cse69 4) 0)))) (let ((.cse72 (+ (- 3) .cse18))) (let ((.cse70 (div .cse72 4))) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 12)) (<= .cse29 .cse70) (not (= .cse70 0)) .cse17 (= (mod .cse71 4) 0) (not (= (+ (* (div .cse72 8) 2) 1) .cse70)) (<= .cse70 .cse58))))) .cse8) (and .cse5 (or (and .cse23 (<= .cse61 .cse26) .cse24 (<= .cse26 .cse60) (= (* 23 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) .cse14) (and (<= (+ .cse25 2 .cse30) 0) .cse15 .cse32 .cse33 (<= 0 (+ .cse25 3 .cse30)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 21))))) (and .cse5 (or (and (<= .cse73 .cse12) .cse14 (= (* 19 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse65 .cse61) .cse66) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 17)) .cse15 (<= .cse73 .cse16) (<= .cse63 .cse61) .cse64))) (and .cse8 (or (and .cse19 (<= .cse38 .cse61) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 18)) (<= .cse73 .cse20) .cse40) (and (<= .cse73 .cse18) .cse17 (= .cse74 |c_ULTIMATE.start_main_~z~0#1|) .cse35 .cse37))) (and (or (and .cse19 (= (* |c_ULTIMATE.start_main_~a~0#1| 30) |c_ULTIMATE.start_main_~z~0#1|) (= .cse20 .cse22)) (and (= .cse22 .cse18) (= (* |c_ULTIMATE.start_main_~a~0#1| 28) |c_ULTIMATE.start_main_~z~0#1|) .cse17)) .cse8) (and .cse5 (or (and (<= 6 .cse16) .cse15 (<= (div .cse75 16) .cse29) (<= .cse52 .cse16) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 9)) .cse64) (and (<= (div .cse76 8) .cse29) (= (* |c_ULTIMATE.start_main_~a~0#1| 11) |c_ULTIMATE.start_main_~z~0#1|) (<= 6 .cse12) .cse14 .cse66 (<= .cse52 .cse12)))) (and .cse5 (or (and (<= .cse16 .cse22) .cse15 (= (* |c_ULTIMATE.start_main_~a~0#1| 25) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse62 .cse16) .cse64) (and (<= .cse12 .cse22) (<= .cse62 .cse12) .cse14 (= (* |c_ULTIMATE.start_main_~a~0#1| 27) |c_ULTIMATE.start_main_~z~0#1|) .cse66))))))) .cse3 .cse4 (not (and .cse3 (= |c_ULTIMATE.start_main_~x~0#1| .cse51) (or (and .cse8 (or (and .cse17 (<= .cse29 .cse18) .cse35 .cse0 (<= .cse18 .cse58)) (and .cse19 .cse21 (not (= .cse20 0)) (<= .cse29 .cse20) (<= .cse20 .cse58) .cse40))) (and .cse5 (or (and (= .cse12 .cse58) .cse14 .cse27) (and (= .cse16 .cse58) .cse15 .cse31))) (and .cse8 (or (and .cse19 .cse42 (= .cse20 .cse58)) (and (= .cse18 .cse58) .cse49 .cse17))) (and .cse5 (or (and (not (= .cse16 0)) (<= .cse16 .cse58) (<= .cse29 .cse16) .cse15 .cse6 .cse64) (and (<= .cse29 .cse12) .cse13 (not (= .cse12 0)) .cse14 (<= .cse12 .cse58) .cse66)))))) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 16)) .cse2) .cse3 (= .cse74 |c_ULTIMATE.start_main_~x~0#1|))))))))) is different from false [2024-12-06 05:58:05,904 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse75 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse7 (div .cse75 2)) (.cse9 (div |c_ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse53 (+ (- 1) .cse9)) (.cse76 (+ (- 1) .cse7))) (let ((.cse12 (div .cse76 2)) (.cse65 (div .cse76 4)) (.cse29 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse63 (div .cse75 8)) (.cse16 (div .cse75 4)) (.cse14 (= (mod .cse7 2) 1)) (.cse19 (= (mod .cse9 2) 1)) (.cse11 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse5 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse20 (div .cse53 2)) (.cse38 (div .cse53 4)) (.cse10 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse36 (div |c_ULTIMATE.start_main_~b~0#1| 8)) (.cse18 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (let ((.cse4 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 32))) (.cse51 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse35 (not (= (+ 1 (* .cse36 2)) .cse18))) (.cse0 (= |c_ULTIMATE.start_main_~z~0#1| 0)) (.cse21 (= |c_ULTIMATE.start_main_~z~0#1| .cse10)) (.cse40 (not (= .cse20 (+ (* .cse38 2) 1)))) (.cse27 (= (* 7 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (.cse31 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 5))) (.cse8 (not .cse5)) (.cse42 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 6))) (.cse49 (= |c_ULTIMATE.start_main_~z~0#1| .cse11)) (.cse17 (not .cse19)) (.cse15 (not .cse14)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse64 (not (= (+ (* .cse63 2) 1) .cse16))) (.cse13 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 3))) (.cse58 (+ .cse29 1)) (.cse66 (not (= .cse12 (+ (* 2 .cse65) 1)))) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse3 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse74 (* |c_ULTIMATE.start_main_~a~0#1| 16))) (and (not (and (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~b~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 31 (* |c_ULTIMATE.start_main_~y~0#1| 32))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 32)) .cse2) .cse3 .cse4)) (not (and .cse3 (or (and .cse5 .cse6 (= |c_ULTIMATE.start_main_~y~0#1| .cse7)) (and .cse8 .cse0 (= |c_ULTIMATE.start_main_~y~0#1| .cse9))) (= |c_ULTIMATE.start_main_~x~0#1| .cse10))) (not (and (= |c_ULTIMATE.start_main_~x~0#1| .cse11) (or (and (not (= .cse7 0)) .cse5 (or (and (= |c_ULTIMATE.start_main_~y~0#1| .cse12) .cse13 .cse14) (and .cse15 .cse6 (= |c_ULTIMATE.start_main_~y~0#1| .cse16)))) (and (or (and .cse17 .cse0 (= |c_ULTIMATE.start_main_~y~0#1| .cse18)) (and .cse19 (= .cse20 |c_ULTIMATE.start_main_~y~0#1|) .cse21)) .cse8)) .cse3)) (let ((.cse47 (+ (- 1) .cse18)) (.cse45 (+ .cse20 (- 1))) (.cse28 (+ (- 1) .cse12)) (.cse55 (* (- 1) .cse16)) (.cse25 (* |c_ULTIMATE.start_main_~y~0#1| 4))) (let ((.cse61 (+ .cse25 2)) (.cse39 (* |c_ULTIMATE.start_main_~y~0#1| 8)) (.cse30 (div (+ .cse55 1) 2)) (.cse56 (+ .cse12 1)) (.cse26 (div .cse28 2)) (.cse69 (+ .cse20 1)) (.cse43 (div .cse45 2)) (.cse71 (+ .cse18 1)) (.cse46 (div .cse47 2))) (let ((.cse34 (div |c_ULTIMATE.start_main_~b~0#1| 16)) (.cse48 (not (= (mod .cse46 2) 1))) (.cse50 (= (mod .cse71 2) 0)) (.cse41 (not (= (mod .cse43 2) 1))) (.cse44 (= (mod .cse69 2) 0)) (.cse23 (not (= (mod .cse26 2) 1))) (.cse24 (= (mod .cse56 2) 0)) (.cse60 (+ .cse25 3)) (.cse32 (= 0 (mod (+ .cse16 1) 2))) (.cse33 (not (= (mod .cse30 2) 1))) (.cse73 (+ .cse39 4)) (.cse37 (<= .cse36 .cse61)) (.cse52 (+ 2 .cse39)) (.cse22 (+ 7 .cse39)) (.cse62 (+ 6 .cse39))) (or (and .cse5 (or (and (= .cse12 .cse22) .cse14 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 31))) (and (= .cse22 .cse16) .cse15 (= (* |c_ULTIMATE.start_main_~a~0#1| 29) |c_ULTIMATE.start_main_~z~0#1|)))) (and .cse5 (or (and .cse23 .cse24 (<= .cse25 .cse26) .cse14 .cse27 (<= 2 .cse26) (<= (div .cse28 4) .cse29)) (and (<= (div (* (- 1) .cse30) 2) .cse29) .cse15 .cse31 (<= 1 |c_ULTIMATE.start_main_~y~0#1|) .cse32 .cse33 (<= (+ .cse25 .cse30) 0)))) (and (or (and .cse17 (<= .cse29 .cse34) .cse35 .cse0 (<= (+ (* (div (+ (- 1) .cse36) 4) 2) 2) .cse34) .cse37) (and .cse19 .cse21 (<= 4 .cse20) (<= (+ (div (+ (- 1) .cse38) 2) 1) .cse29) (<= .cse39 .cse20) .cse40)) .cse8) (and (or (and .cse19 .cse41 .cse42 (<= .cse25 .cse43) .cse44 (<= 2 .cse43) (<= (div .cse45 4) .cse29)) (and (<= .cse25 .cse46) (<= (div .cse47 4) .cse29) .cse48 (<= 2 .cse46) .cse49 .cse17 .cse50)) .cse8) (and .cse8 (or (and (<= 6 .cse18) (= .cse51 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse52 .cse18) .cse17 (<= .cse34 .cse29) .cse35) (and .cse19 (<= .cse52 .cse20) (<= 6 .cse20) (<= (div .cse53 8) .cse29) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 10)) .cse40))) (and .cse5 (or (let ((.cse54 (div (+ 3 .cse55) 4))) (and (not (= .cse54 0)) (= (mod (+ (* 3 .cse16) 3) 4) 0) (<= (mod .cse54 2) 0) .cse15 (<= 0 (+ .cse29 .cse54 1)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 13)) (<= (+ .cse29 .cse54) 0))) (let ((.cse59 (+ .cse12 (- 3)))) (let ((.cse57 (div .cse59 4))) (and (= (mod .cse56 4) 0) (<= .cse29 .cse57) (<= .cse57 .cse58) (not (= .cse57 (+ (* 2 (div .cse59 8)) 1))) .cse14 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 15)) (not (= .cse57 0))))))) (and .cse8 (or (and .cse48 .cse17 (<= .cse46 .cse60) (<= .cse61 .cse46) (= (* |c_ULTIMATE.start_main_~a~0#1| 20) |c_ULTIMATE.start_main_~z~0#1|) .cse50) (and .cse19 (<= .cse61 .cse43) .cse41 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 22)) .cse44 (<= .cse43 .cse60)))) (and (or (and .cse19 (<= .cse20 .cse22) (<= .cse62 .cse20) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 26)) .cse40) (and (= (* |c_ULTIMATE.start_main_~a~0#1| 24) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse18 .cse22) (<= .cse62 .cse18) .cse17 .cse35)) .cse8) (and .cse5 (or (and (<= .cse39 .cse16) .cse15 .cse6 (<= (+ (div (+ (- 1) .cse63) 2) 1) .cse29) (<= 4 .cse16) .cse64) (and (<= (+ (div (+ (- 1) .cse65) 2) 1) .cse29) (<= 4 .cse12) (<= .cse39 .cse12) .cse13 .cse14 .cse66))) (and (or (let ((.cse68 (+ .cse20 (- 3)))) (let ((.cse67 (div .cse68 4))) (and .cse19 (<= .cse67 .cse58) (<= .cse29 .cse67) (not (= (+ (* (div .cse68 8) 2) 1) .cse67)) (not (= .cse67 0)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 14)) (= (mod .cse69 4) 0)))) (let ((.cse72 (+ (- 3) .cse18))) (let ((.cse70 (div .cse72 4))) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 12)) (<= .cse29 .cse70) (not (= .cse70 0)) .cse17 (= (mod .cse71 4) 0) (not (= (+ (* (div .cse72 8) 2) 1) .cse70)) (<= .cse70 .cse58))))) .cse8) (and .cse5 (or (and .cse23 (<= .cse61 .cse26) .cse24 (<= .cse26 .cse60) (= (* 23 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) .cse14) (and (<= (+ .cse25 2 .cse30) 0) .cse15 .cse32 .cse33 (<= 0 (+ .cse25 3 .cse30)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 21))))) (and .cse5 (or (and (<= .cse73 .cse12) .cse14 (= (* 19 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse65 .cse61) .cse66) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 17)) .cse15 (<= .cse73 .cse16) (<= .cse63 .cse61) .cse64))) (and .cse8 (or (and .cse19 (<= .cse38 .cse61) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 18)) (<= .cse73 .cse20) .cse40) (and (<= .cse73 .cse18) .cse17 (= .cse74 |c_ULTIMATE.start_main_~z~0#1|) .cse35 .cse37))) (and (or (and .cse19 (= (* |c_ULTIMATE.start_main_~a~0#1| 30) |c_ULTIMATE.start_main_~z~0#1|) (= .cse20 .cse22)) (and (= .cse22 .cse18) (= (* |c_ULTIMATE.start_main_~a~0#1| 28) |c_ULTIMATE.start_main_~z~0#1|) .cse17)) .cse8) (and .cse5 (or (and (<= 6 .cse16) .cse15 (<= (div .cse75 16) .cse29) (<= .cse52 .cse16) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 9)) .cse64) (and (<= (div .cse76 8) .cse29) (= (* |c_ULTIMATE.start_main_~a~0#1| 11) |c_ULTIMATE.start_main_~z~0#1|) (<= 6 .cse12) .cse14 .cse66 (<= .cse52 .cse12)))) (and .cse5 (or (and (<= .cse16 .cse22) .cse15 (= (* |c_ULTIMATE.start_main_~a~0#1| 25) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse62 .cse16) .cse64) (and (<= .cse12 .cse22) (<= .cse62 .cse12) .cse14 (= (* |c_ULTIMATE.start_main_~a~0#1| 27) |c_ULTIMATE.start_main_~z~0#1|) .cse66))))))) .cse3 .cse4 (not (and .cse3 (= |c_ULTIMATE.start_main_~x~0#1| .cse51) (or (and .cse8 (or (and .cse17 (<= .cse29 .cse18) .cse35 .cse0 (<= .cse18 .cse58)) (and .cse19 .cse21 (not (= .cse20 0)) (<= .cse29 .cse20) (<= .cse20 .cse58) .cse40))) (and .cse5 (or (and (= .cse12 .cse58) .cse14 .cse27) (and (= .cse16 .cse58) .cse15 .cse31))) (and .cse8 (or (and .cse19 .cse42 (= .cse20 .cse58)) (and (= .cse18 .cse58) .cse49 .cse17))) (and .cse5 (or (and (not (= .cse16 0)) (<= .cse16 .cse58) (<= .cse29 .cse16) .cse15 .cse6 .cse64) (and (<= .cse29 .cse12) .cse13 (not (= .cse12 0)) .cse14 (<= .cse12 .cse58) .cse66)))))) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 16)) .cse2) .cse3 (= .cse74 |c_ULTIMATE.start_main_~x~0#1|)))))))))) is different from true [2024-12-06 05:58:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:58:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 98 states and 287 transitions. [2024-12-06 05:58:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 287 transitions. [2024-12-06 05:58:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:58:05,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:58:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:58:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:58:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:58:06,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-06 05:58:06,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:58:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:58:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:58:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 99 states and 293 transitions. [2024-12-06 05:58:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 293 transitions. [2024-12-06 05:58:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:58:31,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:58:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:58:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:58:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:58:31,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-12-06 05:58:31,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:58:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:58:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:58:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 99 states and 293 transitions. [2024-12-06 05:58:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 293 transitions. [2024-12-06 05:58:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 05:58:47,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:58:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:58:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:58:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:58:47,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-06 05:58:47,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:58:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.