./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:04:53,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:04:53,677 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:04:53,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:04:53,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:04:53,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:04:53,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:04:53,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:04:53,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:04:53,707 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:04:53,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:04:53,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:04:53,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:04:53,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:04:53,710 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:04:53,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:04:53,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:04:53,712 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:04:53,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:04:53,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:04:53,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:04:53,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:04:53,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:04:53,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:04:53,715 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:04:53,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:04:53,716 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:04:53,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:04:53,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:04:53,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:04:53,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:04:53,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:04:53,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:04:53,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:04:53,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:04:53,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:04:53,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:04:53,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:04:53,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:04:53,721 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:04:53,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:04:53,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:04:53,722 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2023-11-29 00:04:53,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:04:53,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:04:53,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:04:53,962 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:04:53,962 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:04:53,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2023-11-29 00:04:56,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:04:56,861 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:04:56,862 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/sv-benchmarks/c/float-benchs/sqrt_poly.c [2023-11-29 00:04:56,867 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data/e4074f2b3/a642a54597d6470eb5e33960de599984/FLAGe8c1d73b1 [2023-11-29 00:04:56,878 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data/e4074f2b3/a642a54597d6470eb5e33960de599984 [2023-11-29 00:04:56,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:04:56,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:04:56,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:04:56,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:04:56,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:04:56,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:56" (1/1) ... [2023-11-29 00:04:56,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8fb858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:56, skipping insertion in model container [2023-11-29 00:04:56,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:56" (1/1) ... [2023-11-29 00:04:56,909 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:04:57,026 WARN L240 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2023-11-29 00:04:57,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:04:57,047 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:04:57,060 WARN L240 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2023-11-29 00:04:57,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:04:57,078 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:04:57,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57 WrapperNode [2023-11-29 00:04:57,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:04:57,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:04:57,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:04:57,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:04:57,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,116 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2023-11-29 00:04:57,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:04:57,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:04:57,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:04:57,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:04:57,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:04:57,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:04:57,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:04:57,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:04:57,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:04:57,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (1/1) ... [2023-11-29 00:04:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:04:57,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:04:57,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:04:57,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:04:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:04:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:04:57,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:04:57,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:04:57,281 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:04:57,283 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:04:57,370 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:04:57,397 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:04:57,397 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:04:57,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:57 BoogieIcfgContainer [2023-11-29 00:04:57,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:04:57,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:04:57,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:04:57,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:04:57,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:04:56" (1/3) ... [2023-11-29 00:04:57,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1fd22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:04:57, skipping insertion in model container [2023-11-29 00:04:57,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:57" (2/3) ... [2023-11-29 00:04:57,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1fd22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:04:57, skipping insertion in model container [2023-11-29 00:04:57,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:57" (3/3) ... [2023-11-29 00:04:57,408 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2023-11-29 00:04:57,424 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:04:57,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:04:57,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:04:57,475 INFO L357 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, mHoare=true, 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;@109c51cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:04:57,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:04:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:04:57,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:57,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:57,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:04:57,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash 229987977, now seen corresponding path program 1 times [2023-11-29 00:04:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725666835] [2023-11-29 00:04:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725666835] [2023-11-29 00:04:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725666835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:04:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694962222] [2023-11-29 00:04:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:57,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:04:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:04:57,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:04:57,662 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:57,681 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-11-29 00:04:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:04:57,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:04:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:57,690 INFO L225 Difference]: With dead ends: 18 [2023-11-29 00:04:57,690 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 00:04:57,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:04:57,696 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:57,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:04:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 00:04:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 00:04:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 00:04:57,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2023-11-29 00:04:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:57,722 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 00:04:57,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 00:04:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:04:57,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:57,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:57,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:04:57,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:04:57,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash 287246279, now seen corresponding path program 1 times [2023-11-29 00:04:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748900899] [2023-11-29 00:04:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:57,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:57,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:04:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:57,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:04:57,795 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:04:57,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:04:57,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:04:57,803 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 00:04:57,807 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:04:57,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:04:57 BoogieIcfgContainer [2023-11-29 00:04:57,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:04:57,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:04:57,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:04:57,826 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:04:57,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:57" (3/4) ... [2023-11-29 00:04:57,828 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:04:57,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:04:57,830 INFO L158 Benchmark]: Toolchain (without parser) took 948.86ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 128.8MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:04:57,831 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:04:57,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.88ms. Allocated memory is still 161.5MB. Free memory was 122.6MB in the beginning and 112.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:04:57,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.14ms. Allocated memory is still 161.5MB. Free memory was 112.1MB in the beginning and 110.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:04:57,832 INFO L158 Benchmark]: Boogie Preprocessor took 37.20ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 109.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:04:57,833 INFO L158 Benchmark]: RCFGBuilder took 242.70ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 99.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 00:04:57,833 INFO L158 Benchmark]: TraceAbstraction took 424.45ms. Allocated memory is still 161.5MB. Free memory was 98.5MB in the beginning and 129.5MB in the end (delta: -31.0MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2023-11-29 00:04:57,834 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 161.5MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:04:57,837 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.19ms. Allocated memory is still 109.1MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.88ms. Allocated memory is still 161.5MB. Free memory was 122.6MB in the beginning and 112.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.14ms. Allocated memory is still 161.5MB. Free memory was 112.1MB in the beginning and 110.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.20ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 109.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 242.70ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 99.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 424.45ms. Allocated memory is still 161.5MB. Free memory was 98.5MB in the beginning and 129.5MB in the end (delta: -31.0MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 161.5MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L25] CALL assume_abort_if_not(I >= 1. && I <= 3.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, sqrt2=11863283/8388608] [L25] RET assume_abort_if_not(I >= 1. && I <= 3.) [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L30] CALL __VERIFIER_assert(S >= 1. && S <= 2.) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] [L16] reach_error() VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 8 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:04:57,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:04:59,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:04:59,921 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:04:59,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:04:59,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:04:59,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:04:59,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:04:59,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:04:59,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:04:59,966 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:04:59,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:04:59,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:04:59,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:04:59,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:04:59,969 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:04:59,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:04:59,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:04:59,971 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:04:59,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:04:59,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:04:59,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:04:59,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:04:59,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:04:59,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:04:59,974 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:04:59,975 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:04:59,975 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:04:59,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:04:59,976 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:04:59,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:04:59,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:04:59,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:04:59,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:04:59,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:04:59,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:04:59,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:04:59,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:04:59,979 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:04:59,979 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:04:59,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:04:59,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:04:59,980 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:04:59,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:04:59,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:04:59,981 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:04:59,981 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2023-11-29 00:05:00,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:05:00,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:05:00,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:05:00,306 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:05:00,306 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:05:00,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2023-11-29 00:05:03,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:05:03,293 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:05:03,293 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/sv-benchmarks/c/float-benchs/sqrt_poly.c [2023-11-29 00:05:03,301 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data/85d6846af/7a57d356c855480ab0c9a1c72a335b04/FLAG7707116b9 [2023-11-29 00:05:03,318 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/data/85d6846af/7a57d356c855480ab0c9a1c72a335b04 [2023-11-29 00:05:03,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:05:03,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:05:03,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:05:03,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:05:03,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:05:03,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56858ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03, skipping insertion in model container [2023-11-29 00:05:03,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:05:03,514 WARN L240 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2023-11-29 00:05:03,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:05:03,544 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:05:03,558 WARN L240 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_433e3fd1-ece4-4e22-b82a-258fb40fd624/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2023-11-29 00:05:03,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:05:03,581 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:05:03,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03 WrapperNode [2023-11-29 00:05:03,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:05:03,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:05:03,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:05:03,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:05:03,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,623 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2023-11-29 00:05:03,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:05:03,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:05:03,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:05:03,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:05:03,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:05:03,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:05:03,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:05:03,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:05:03,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:05:03,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (1/1) ... [2023-11-29 00:05:03,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:05:03,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:05:03,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:05:03,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:05:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:05:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:05:03,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:05:03,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:05:03,802 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:05:03,804 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:05:12,286 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:05:12,320 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:05:12,321 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:05:12,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:05:12 BoogieIcfgContainer [2023-11-29 00:05:12,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:05:12,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:05:12,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:05:12,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:05:12,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:05:03" (1/3) ... [2023-11-29 00:05:12,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7284bc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:05:12, skipping insertion in model container [2023-11-29 00:05:12,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:05:03" (2/3) ... [2023-11-29 00:05:12,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7284bc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:05:12, skipping insertion in model container [2023-11-29 00:05:12,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:05:12" (3/3) ... [2023-11-29 00:05:12,330 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2023-11-29 00:05:12,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:05:12,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:05:12,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:05:12,390 INFO L357 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, mHoare=true, 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;@42b95216, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:05:12,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:05:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:05:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:05:12,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:05:12,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:05:12,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:05:12,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:05:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash 229987977, now seen corresponding path program 1 times [2023-11-29 00:05:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:05:12,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636222492] [2023-11-29 00:05:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:05:12,415 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 [2023-11-29 00:05:12,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:05:12,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:05:12,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:05:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:05:13,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:05:13,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:05:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:05:13,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:05:13,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:05:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636222492] [2023-11-29 00:05:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636222492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:05:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:05:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:05:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039428008] [2023-11-29 00:05:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:05:13,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:05:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:05:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:05:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:05:13,203 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:05:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:05:13,235 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-11-29 00:05:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:05:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:05:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:05:13,244 INFO L225 Difference]: With dead ends: 18 [2023-11-29 00:05:13,244 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 00:05:13,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:05:13,250 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:05:13,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:05:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 00:05:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 00:05:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:05:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 00:05:13,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2023-11-29 00:05:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:05:13,275 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 00:05:13,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:05:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 00:05:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:05:13,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:05:13,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:05:13,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 00:05:13,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:05:13,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:05:13,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:05:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash 287246279, now seen corresponding path program 1 times [2023-11-29 00:05:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:05:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195279451] [2023-11-29 00:05:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:05:13,480 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 [2023-11-29 00:05:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:05:13,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:05:13,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:05:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:05:15,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:05:15,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:05:26,386 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:05:34,852 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:05:43,372 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:05:47,509 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 00:06:00,240 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:06:08,698 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:06:17,247 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:06:25,760 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:06:42,482 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:06:50,995 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:06:59,227 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:07:11,801 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:07:20,233 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:07:28,455 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:07:32,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| .cse1) (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse0)))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse3))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse3))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse9)))))))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| .cse1) (fp.geq .cse8 .cse3) (fp.leq .cse8 .cse0)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2023-11-29 00:07:45,470 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:07:54,006 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:08:02,223 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:08:14,917 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:08:23,460 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:08:31,702 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:08:35,932 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| .cse1) (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse0)))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse3)))))) is different from false [2023-11-29 00:08:40,001 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| .cse1) (not (fp.leq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4)))))) .cse0)))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse3))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7)))))) .cse3)))))) is different from true [2023-11-29 00:08:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:08:40,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:08:40,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:08:40,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195279451] [2023-11-29 00:08:40,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195279451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:08:40,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:08:40,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:08:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140991704] [2023-11-29 00:08:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:08:40,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:08:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:08:40,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:08:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=9, Unknown=4, NotChecked=18, Total=42 [2023-11-29 00:08:40,007 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:08:44,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:48,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:53,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse1) (= |c_ULTIMATE.start_main_~S~0#1| (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse1) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))))) (fp.leq |c_ULTIMATE.start_main_~I~0#1| .cse0) (= c_~sqrt2~0 .cse2) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse3) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 00:08:57,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:09:01,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:09:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:09:01,890 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2023-11-29 00:09:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:09:01,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:09:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:09:01,892 INFO L225 Difference]: With dead ends: 12 [2023-11-29 00:09:01,892 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 00:09:01,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=17, Invalid=14, Unknown=5, NotChecked=36, Total=72 [2023-11-29 00:09:01,894 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:09:01,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 4 Unknown, 33 Unchecked, 17.4s Time] [2023-11-29 00:09:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 00:09:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 00:09:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:09:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2023-11-29 00:09:01,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2023-11-29 00:09:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:09:01,899 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2023-11-29 00:09:01,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:09:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2023-11-29 00:09:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:09:01,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:09:01,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:09:01,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:09:02,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:09:02,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:09:02,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash 287305861, now seen corresponding path program 1 times [2023-11-29 00:09:02,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:09:02,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850164050] [2023-11-29 00:09:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:02,102 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 [2023-11-29 00:09:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:09:02,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:09:02,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 (4)] Waiting until timeout for monitored process [2023-11-29 00:09:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:04,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:09:04,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:09:14,409 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:09:23,092 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:09:31,382 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:09:36,215 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 00:09:53,235 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:10:01,916 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:10:10,221 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:10:23,021 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:10:31,320 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:10:40,040 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:10:52,913 WARN L293 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:11:01,602 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:11:10,278 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:11:18,954 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:11:23,353 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse3 .cse6))))))))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2)))))) (and (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse7 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse7 .cse6))))))) .cse0)))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse8 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse6))))))) .cse2)) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false [2023-11-29 00:11:36,288 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:11:45,007 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:11:53,315 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:12:06,215 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:12:14,509 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:12:23,231 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:12:27,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse1)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 .cse5))))))) .cse0)))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse6 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 .cse5))))))) .cse1)) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse1)))))) is different from false [2023-11-29 00:12:31,575 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse1)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 .cse5))))))) .cse0)))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (let ((.cse6 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 .cse5))))))) .cse1)) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse1)))))) is different from true [2023-11-29 00:12:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:31,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:12:31,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:12:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850164050] [2023-11-29 00:12:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850164050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:31,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:12:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425686662] [2023-11-29 00:12:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:31,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:12:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:12:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:12:31,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=9, Unknown=4, NotChecked=18, Total=42 [2023-11-29 00:12:31,578 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:36,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:12:40,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:12:44,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (and (= |c_ULTIMATE.start_main_~S~0#1| (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 00:12:44,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:12:44,807 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2023-11-29 00:12:44,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:12:44,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:12:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:12:44,807 INFO L225 Difference]: With dead ends: 8 [2023-11-29 00:12:44,808 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:12:44,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=17, Invalid=14, Unknown=5, NotChecked=36, Total=72 [2023-11-29 00:12:44,809 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:12:44,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 21 Unchecked, 8.7s Time] [2023-11-29 00:12:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:12:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:12:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:12:44,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2023-11-29 00:12:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:12:44,811 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:12:44,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:12:44,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:12:44,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:12:44,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 (4)] Ended with exit code 0 [2023-11-29 00:12:45,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:12:45,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:12:45,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:12:45,018 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 28) no Hoare annotation was computed. [2023-11-29 00:12:45,018 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 28) no Hoare annotation was computed. [2023-11-29 00:12:45,018 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2023-11-29 00:12:45,018 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:12:45,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-11-29 00:12:45,019 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-11-29 00:12:45,019 INFO L899 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2023-11-29 00:12:45,019 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2023-11-29 00:12:45,019 INFO L899 garLoopResultBuilder]: For program point L16-3(line 16) no Hoare annotation was computed. [2023-11-29 00:12:45,022 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 00:12:45,023 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:12:45,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:12:45 BoogieIcfgContainer [2023-11-29 00:12:45,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:12:45,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:12:45,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:12:45,027 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:12:45,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:05:12" (3/4) ... [2023-11-29 00:12:45,029 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:12:45,034 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-29 00:12:45,035 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 00:12:45,035 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:12:45,035 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:12:45,108 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:12:45,109 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:12:45,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:12:45,110 INFO L158 Benchmark]: Toolchain (without parser) took 461787.51ms. Allocated memory is still 94.4MB. Free memory was 70.8MB in the beginning and 36.8MB in the end (delta: 33.9MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2023-11-29 00:12:45,110 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 62.9MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:12:45,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.38ms. Allocated memory is still 94.4MB. Free memory was 70.5MB in the beginning and 59.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:12:45,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.56ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 58.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:12:45,117 INFO L158 Benchmark]: Boogie Preprocessor took 46.25ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 55.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:12:45,117 INFO L158 Benchmark]: RCFGBuilder took 8650.56ms. Allocated memory is still 94.4MB. Free memory was 55.9MB in the beginning and 68.5MB in the end (delta: -12.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-11-29 00:12:45,118 INFO L158 Benchmark]: TraceAbstraction took 452702.63ms. Allocated memory is still 94.4MB. Free memory was 67.8MB in the beginning and 41.2MB in the end (delta: 26.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-11-29 00:12:45,118 INFO L158 Benchmark]: Witness Printer took 82.20ms. Allocated memory is still 94.4MB. Free memory was 41.0MB in the beginning and 36.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:12:45,120 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.24ms. Allocated memory is still 62.9MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.38ms. Allocated memory is still 94.4MB. Free memory was 70.5MB in the beginning and 59.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.56ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 58.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.25ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 55.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8650.56ms. Allocated memory is still 94.4MB. Free memory was 55.9MB in the beginning and 68.5MB in the end (delta: -12.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 452702.63ms. Allocated memory is still 94.4MB. Free memory was 67.8MB in the beginning and 41.2MB in the end (delta: 26.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Witness Printer took 82.20ms. Allocated memory is still 94.4MB. Free memory was 41.0MB in the beginning and 36.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 452.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 26.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 26.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 54 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 12 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 411.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 6 QuantifiedInterpolants, 998 SizeOfPredicates, 15 NumberOfNonLiveVariables, 72 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 00:12:45,335 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 00:12:45,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_433e3fd1-ece4-4e22-b82a-258fb40fd624/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE