./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 725f145f29173a8eb9d341d6c4f743ec9526dd2a9ceaf2d591ceb6d76764d49f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:12:38,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:12:38,416 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:12:38,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:12:38,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:12:38,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:12:38,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:12:38,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:12:38,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:12:38,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:12:38,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:12:38,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:12:38,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:12:38,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:12:38,470 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:12:38,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:12:38,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:12:38,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:12:38,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:12:38,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:12:38,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:12:38,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:12:38,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:12:38,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:12:38,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:12:38,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:12:38,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:12:38,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:12:38,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:12:38,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:12:38,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:12:38,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:12:38,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:38,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:12:38,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:12:38,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:12:38,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:12:38,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:12:38,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:12:38,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:12:38,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:12:38,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:12:38,484 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 725f145f29173a8eb9d341d6c4f743ec9526dd2a9ceaf2d591ceb6d76764d49f [2024-11-08 17:12:38,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:12:38,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:12:38,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:12:38,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:12:38,826 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:12:38,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i Unable to find full path for "g++" [2024-11-08 17:12:40,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:12:41,021 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:12:41,021 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i [2024-11-08 17:12:41,030 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data/9515f1851/a7b585fea76442a088a55ddc703604f9/FLAGa82549fe9 [2024-11-08 17:12:41,054 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data/9515f1851/a7b585fea76442a088a55ddc703604f9 [2024-11-08 17:12:41,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:12:41,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:12:41,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:41,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:12:41,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:12:41,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:41" (1/1) ... [2024-11-08 17:12:41,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ec1988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:41, skipping insertion in model container [2024-11-08 17:12:41,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:41" (1/1) ... [2024-11-08 17:12:41,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:12:41,301 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_91b19714-b347-45e5-a320-139bb150afeb/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i[948,961] [2024-11-08 17:12:41,316 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3125) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1625) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:792) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1520) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:224) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1167) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1150) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1652) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3539) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2522) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:642) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-08 17:12:41,325 INFO L158 Benchmark]: Toolchain (without parser) took 263.32ms. Allocated memory is still 155.2MB. Free memory was 127.2MB in the beginning and 116.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 17:12:41,325 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:12:41,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.59ms. Allocated memory is still 155.2MB. Free memory was 127.2MB in the beginning and 116.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 17:12:41,327 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.59ms. Allocated memory is still 155.2MB. Free memory was 127.2MB in the beginning and 116.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 725f145f29173a8eb9d341d6c4f743ec9526dd2a9ceaf2d591ceb6d76764d49f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:12:43,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:12:43,879 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:12:43,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:12:43,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:12:43,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:12:43,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:12:43,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:12:43,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:12:43,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:12:43,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:12:43,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:12:43,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:12:43,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:12:43,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:12:43,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:12:43,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:12:43,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:12:43,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:12:43,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:12:43,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:12:43,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:12:43,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:12:43,945 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:12:43,945 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:12:43,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:12:43,946 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:12:43,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:12:43,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:12:43,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:12:43,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:12:43,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:12:43,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:12:43,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:12:43,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:43,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:12:43,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:12:43,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:12:43,953 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:12:43,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:12:43,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:12:43,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:12:43,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:12:43,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:12:43,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 725f145f29173a8eb9d341d6c4f743ec9526dd2a9ceaf2d591ceb6d76764d49f [2024-11-08 17:12:44,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:12:44,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:12:44,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:12:44,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:12:44,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:12:44,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i Unable to find full path for "g++" [2024-11-08 17:12:46,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:12:46,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:12:46,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i [2024-11-08 17:12:46,779 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data/c459b8faf/8de75b40082b4b228673a55b9a7d4cc1/FLAG40a79d7bc [2024-11-08 17:12:46,806 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/data/c459b8faf/8de75b40082b4b228673a55b9a7d4cc1 [2024-11-08 17:12:46,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:12:46,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:12:46,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:46,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:12:46,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:12:46,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:46" (1/1) ... [2024-11-08 17:12:46,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea8cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:46, skipping insertion in model container [2024-11-08 17:12:46,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:46" (1/1) ... [2024-11-08 17:12:46,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:12:47,100 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_91b19714-b347-45e5-a320-139bb150afeb/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i[948,961] [2024-11-08 17:12:47,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:47,195 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:12:47,219 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_91b19714-b347-45e5-a320-139bb150afeb/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound100.i[948,961] [2024-11-08 17:12:47,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:47,299 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:12:47,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47 WrapperNode [2024-11-08 17:12:47,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:47,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:47,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:12:47,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:12:47,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,394 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2024-11-08 17:12:47,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:47,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:12:47,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:12:47,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:12:47,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,434 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 17:12:47,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:12:47,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:12:47,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:12:47,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:12:47,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (1/1) ... [2024-11-08 17:12:47,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:12:47,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:12:47,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:12:47,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:12:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:12:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:12:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:12:47,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:12:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:12:47,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:12:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 17:12:47,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 17:12:47,610 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:12:47,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:12:52,565 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 17:12:52,565 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:12:52,580 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:12:52,580 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:12:52,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:52 BoogieIcfgContainer [2024-11-08 17:12:52,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:12:52,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:12:52,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:12:52,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:12:52,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:12:46" (1/3) ... [2024-11-08 17:12:52,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e93217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:52, skipping insertion in model container [2024-11-08 17:12:52,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:47" (2/3) ... [2024-11-08 17:12:52,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e93217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:52, skipping insertion in model container [2024-11-08 17:12:52,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:52" (3/3) ... [2024-11-08 17:12:52,595 INFO L112 eAbstractionObserver]: Analyzing ICFG knuth_valuebound100.i [2024-11-08 17:12:52,618 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:12:52,619 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:12:52,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:12:52,724 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7549d848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:12:52,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:12:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 17:12:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 17:12:52,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:52,744 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:52,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:52,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1940833664, now seen corresponding path program 1 times [2024-11-08 17:12:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:12:52,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815248074] [2024-11-08 17:12:52,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:52,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:12:52,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:12:52,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:12:52,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 17:12:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:53,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:12:53,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:12:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 17:12:53,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:12:53,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:12:53,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815248074] [2024-11-08 17:12:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815248074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:53,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:53,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:12:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954126169] [2024-11-08 17:12:53,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:12:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:12:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:12:53,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:12:53,235 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 17:12:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:53,265 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2024-11-08 17:12:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:12:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-08 17:12:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:53,276 INFO L225 Difference]: With dead ends: 59 [2024-11-08 17:12:53,276 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 17:12:53,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:12:53,287 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:53,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 17:12:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 17:12:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 17:12:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-08 17:12:53,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 29 [2024-11-08 17:12:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:53,339 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-08 17:12:53,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 17:12:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-11-08 17:12:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 17:12:53,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:53,342 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:53,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:12:53,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:12:53,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:53,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 474679620, now seen corresponding path program 1 times [2024-11-08 17:12:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:12:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577729460] [2024-11-08 17:12:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:53,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:12:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:12:53,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:12:53,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 17:13:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:25,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 17:13:25,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:13:38,024 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:13:58,874 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:14:06,986 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:14:46,429 WARN L286 SmtUtils]: Spent 28.43s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:14:58,666 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:15:06,761 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:15:42,089 WARN L286 SmtUtils]: Spent 28.47s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:15:54,266 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:02,403 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:10,619 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv100 32)) (bvule |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ bv100 32)) (not (= (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv4294967294 32)))) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))) (.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse1))) (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse1) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| .cse2)) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvmul (_ bv4 32) .cse0))) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse3) (bvmul (_ bv8 32) .cse2)) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4|))))) is different from false [2024-11-08 17:16:14,638 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv100 32)) (bvule |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ bv100 32)) (not (= (let ((.cse1 (bvadd |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv4294967294 32)))) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (.cse3 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))) (.cse2 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse1))) (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse1) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| .cse2)) (bvmul (_ bv4 32) (bvmul .cse3 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvmul (_ bv4 32) .cse0))) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse3) (bvmul (_ bv8 32) .cse2)) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4|))))) is different from true [2024-11-08 17:16:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 17:16:14,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:16:44,421 WARN L873 $PredicateComparison]: unable to prove that (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse3 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1)) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse3)) (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse3)) |c_ULTIMATE.start_main_~a~0#1|)))))) is different from true [2024-11-08 17:16:52,823 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:01,332 WARN L873 $PredicateComparison]: unable to prove that (or (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse3 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse1)) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse2))) (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse3)) (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse3)) |c_ULTIMATE.start_main_~a~0#1|)))))) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32)))) is different from true [2024-11-08 17:17:13,482 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:21,708 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)) (= (let ((.cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse2)) (.cse3 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (.cse0 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv8 32) .cse1)))) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse1)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse2))) (bvneg (bvmul (bvmul (_ bv4 32) .cse3) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (bvmul (_ bv8 32) .cse3) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse0))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2024-11-08 17:17:33,861 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:50,183 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:58,526 WARN L873 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)) (= (let ((.cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (let ((.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse2)) (.cse3 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (.cse0 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv8 32) .cse1)))) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse1)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse2))) (bvneg (bvmul (bvmul (_ bv4 32) .cse3) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|)) (bvmul (_ bv8 32) .cse3) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| .cse0))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2024-11-08 17:18:06,706 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:19,344 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:27,444 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:36,871 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (or (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv100 32))) (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse3 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse1 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse3))) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse0))) (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1| .cse1)) (bvmul (_ bv4 32) (bvmul .cse2 |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul |ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse3))) (bvneg (bvmul (bvadd (bvmul .cse2 (_ bv8 32)) (bvmul (_ bv8 32) .cse1)) |ULTIMATE.start_main_~a~0#1|)))))))) is different from true [2024-11-08 17:18:36,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:18:36,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577729460] [2024-11-08 17:18:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577729460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:18:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979276507] [2024-11-08 17:18:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:18:36,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:18:36,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:18:36,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:18:36,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:19:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:19:17,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 17:19:17,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:19:32,478 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:19:53,902 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:06,145 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:20,435 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:28,543 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:44,855 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:52,967 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 17:20:57,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:20:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979276507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:20:57,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:20:57,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 10 [2024-11-08 17:20:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981721496] [2024-11-08 17:20:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:20:57,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:20:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:20:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:20:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=130, Unknown=11, NotChecked=162, Total=342 [2024-11-08 17:20:57,125 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:21:03,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:21:07,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:21:11,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:21:12,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:27,518 WARN L286 SmtUtils]: Spent 57.65s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:22:32,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:36,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:40,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:44,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:48,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:52,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:56,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:00,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:04,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv100 32)) (bvule |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| (_ bv100 32)) (not (= (let ((.cse2 (bvadd |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (_ bv4294967294 32)))) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (.cse4 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))) (.cse3 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse2))) (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4| .cse2) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvmul (_ bv4 32) (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| .cse3)) (bvmul (_ bv4 32) (bvmul .cse4 |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|)) (bvneg (bvmul |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1| (bvmul (_ bv4 32) .cse1))) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse4) (bvmul (_ bv8 32) .cse3)) |v_ULTIMATE.start_main_~d~0#1_BEFORE_CALL_1|))))) (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_4|))))))) (and .cse0 (or (and .cse0 (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) is different from false [2024-11-08 17:23:09,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:13,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:17,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:20,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:23:22,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:23:26,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:28,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:23:32,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:37,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:41,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:23:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:41,988 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2024-11-08 17:23:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:23:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-08 17:23:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:42,000 INFO L225 Difference]: With dead ends: 44 [2024-11-08 17:23:42,000 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 17:23:42,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 193.8s TimeCoverageRelationStatistics Valid=55, Invalid=198, Unknown=15, NotChecked=238, Total=506 [2024-11-08 17:23:42,002 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 57 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 86.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:42,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 101 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 18 Unknown, 57 Unchecked, 86.9s Time] [2024-11-08 17:23:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 17:23:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2024-11-08 17:23:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:23:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-08 17:23:42,018 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 29 [2024-11-08 17:23:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:42,019 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-08 17:23:42,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:23:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-08 17:23:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 17:23:42,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:42,021 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:42,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:23:42,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 17:23:42,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:23:42,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1079711530, now seen corresponding path program 1 times [2024-11-08 17:23:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:23:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135502646] [2024-11-08 17:23:42,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:42,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:23:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:23:42,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:23:42,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 17:23:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:42,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:23:42,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 17:23:43,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:23:43,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:23:43,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135502646] [2024-11-08 17:23:43,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135502646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:43,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:43,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:23:43,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655778357] [2024-11-08 17:23:43,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:43,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:23:43,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:23:43,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:23:43,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:23:43,457 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:23:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:44,527 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2024-11-08 17:23:44,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:23:44,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-11-08 17:23:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:44,534 INFO L225 Difference]: With dead ends: 46 [2024-11-08 17:23:44,534 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 17:23:44,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:23:44,536 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:44,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 130 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:23:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 17:23:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2024-11-08 17:23:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 17:23:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-08 17:23:44,557 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 34 [2024-11-08 17:23:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:44,557 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-08 17:23:44,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:23:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-08 17:23:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 17:23:44,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:44,559 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:44,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:23:44,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:23:44,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:44,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash -841020348, now seen corresponding path program 1 times [2024-11-08 17:23:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:23:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483174939] [2024-11-08 17:23:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:44,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:23:44,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:23:44,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:23:44,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91b19714-b347-45e5-a320-139bb150afeb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 17:24:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:24,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 17:24:24,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:49,541 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:25:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 17:25:08,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:50,364 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:25:59,468 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse7 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse6 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse5 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse1 (bvmul (_ bv8 32) .cse5)) (.cse2 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse6))) (.cse3 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)))) (.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (.cse4 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse7)))) (or (not (= .cse0 (bvadd .cse1 .cse2 .cse3 .cse4 (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse5))) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse6) (bvmul (_ bv8 32) .cse7)) |c_ULTIMATE.start_main_~a~0#1|))))) (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|) .cse5)) .cse1 .cse2 .cse3 (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse7) (bvmul (_ bv4 32) .cse6)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg .cse0) .cse4)))))) is different from true [2024-11-08 17:26:07,879 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:20,522 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:24,849 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse7 (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse6 (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse5 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse1 (bvmul (_ bv8 32) .cse5)) (.cse2 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse6))) (.cse3 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)))) (.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (.cse4 (bvmul (_ bv4 32) (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1| .cse7)))) (or (not (= .cse0 (bvadd .cse1 .cse2 .cse3 .cse4 (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse5))) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse6) (bvmul (_ bv8 32) .cse7)) |c_ULTIMATE.start_main_~a~0#1|))))) (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|) .cse5)) .cse1 .cse2 .cse3 (bvneg (bvmul (bvadd (bvmul (_ bv4 32) .cse7) (bvmul (_ bv4 32) .cse6)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|))) (bvneg .cse0) .cse4)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))))) is different from true [2024-11-08 17:26:37,024 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:49,330 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:53,418 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (let ((.cse4 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|)) (.cse0 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| .cse8))) (let ((.cse2 (bvmul (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|) (_ bv4 32))) (.cse3 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (.cse6 (bvmul (_ bv8 32) .cse4)) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19|))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| (_ bv2 32)) (= (bvadd (bvneg (bvmul (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|) (bvadd (bvmul (_ bv4 32) .cse0) (bvmul (_ bv4 32) .cse1)))) .cse2 .cse3 (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|) .cse4)) .cse5 .cse6 (bvneg .cse7)) (_ bv0 32)) (not (= (bvadd .cse2 .cse3 .cse5 (bvneg (bvmul (bvmul (_ bv4 32) .cse4) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse0)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|)) .cse6) .cse7)))))))) is different from true [2024-11-08 17:27:05,584 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:27:17,882 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:27:30,082 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:27:42,524 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:27:46,726 WARN L873 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (let ((.cse4 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|)) (.cse0 (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (.cse1 (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| .cse8))) (let ((.cse2 (bvmul (bvmul .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|) (_ bv4 32))) (.cse3 (bvmul (_ bv4 32) (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19| .cse8) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|))) (.cse6 (bvmul (_ bv8 32) .cse4)) (.cse7 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_19|))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14| (_ bv2 32)) (= (bvadd (bvneg (bvmul (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|) (bvadd (bvmul (_ bv4 32) .cse0) (bvmul (_ bv4 32) .cse1)))) .cse2 .cse3 (bvneg (bvmul (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|) .cse4)) .cse5 .cse6 (bvneg .cse7)) (_ bv0 32)) (not (= (bvadd .cse2 .cse3 .cse5 (bvneg (bvmul (bvmul (_ bv4 32) .cse4) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse0)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_14|)) .cse6) .cse7)))))))) is different from true [2024-11-08 17:27:54,965 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:28:07,543 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)