./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i --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_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme --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 b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:58:34,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:58:34,344 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:58:34,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:58:34,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:58:34,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:58:34,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:58:34,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:58:34,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:58:34,382 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:58:34,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:58:34,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:58:34,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:58:34,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:58:34,385 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:58:34,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:58:34,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:58:34,388 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:58:34,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:58:34,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:58:34,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:58:34,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:58:34,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:58:34,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:58:34,400 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:58:34,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:58:34,401 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:58:34,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:58:34,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:58:34,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:58:34,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:58:34,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:34,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:58:34,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:58:34,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:58:34,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:58:34,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:58:34,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:58:34,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:58:34,407 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:58:34,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:58:34,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:58:34,409 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_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme 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 -> b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e [2023-11-26 11:58:34,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:58:34,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:58:34,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:58:34,753 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:58:34,754 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:58:34,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-26 11:58:37,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:58:38,261 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:58:38,263 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-26 11:58:38,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data/bf42d7d5d/fa066af67186421ea18ed0c415b082a5/FLAG311682954 [2023-11-26 11:58:38,297 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data/bf42d7d5d/fa066af67186421ea18ed0c415b082a5 [2023-11-26 11:58:38,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:58:38,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:58:38,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:38,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:58:38,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:58:38,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28956958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38, skipping insertion in model container [2023-11-26 11:58:38,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,366 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:58:38,569 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_3e3d722a-ff56-4817-b9b7-486f9d6656af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-26 11:58:38,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:38,648 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:58:38,662 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_3e3d722a-ff56-4817-b9b7-486f9d6656af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-26 11:58:38,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:38,698 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:38,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38 WrapperNode [2023-11-26 11:58:38,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:38,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:38,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:38,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:38,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,742 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-11-26 11:58:38,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:38,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:38,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:38,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:38,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,774 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-26 11:58:38,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:38,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:38,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:38,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:38,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (1/1) ... [2023-11-26 11:58:38,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:38,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:38,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:58:38,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:58:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:58:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:58:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:58:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:38,944 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:38,946 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:39,196 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:39,257 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:39,257 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:58:39,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:39 BoogieIcfgContainer [2023-11-26 11:58:39,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:39,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:39,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:39,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:39,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:38" (1/3) ... [2023-11-26 11:58:39,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cab483e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:39, skipping insertion in model container [2023-11-26 11:58:39,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:38" (2/3) ... [2023-11-26 11:58:39,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cab483e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:39, skipping insertion in model container [2023-11-26 11:58:39,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:39" (3/3) ... [2023-11-26 11:58:39,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-26 11:58:39,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:39,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:58:39,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:39,353 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;@1c2fc741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:39,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:58:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:58:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:58:39,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:39,373 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:39,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:39,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:39,385 INFO L85 PathProgramCache]: Analyzing trace with hash 517505527, now seen corresponding path program 1 times [2023-11-26 11:58:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265481610] [2023-11-26 11:58:39,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:58:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:58:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:58:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:58:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:58:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:58:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:58:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:58:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:39,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265481610] [2023-11-26 11:58:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265481610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562924094] [2023-11-26 11:58:39,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:39,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:58:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:58:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:58:39,757 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:58:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:39,827 INFO L93 Difference]: Finished difference Result 67 states and 110 transitions. [2023-11-26 11:58:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:58:39,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2023-11-26 11:58:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:39,839 INFO L225 Difference]: With dead ends: 67 [2023-11-26 11:58:39,839 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 11:58:39,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-26 11:58:39,846 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:39,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:58:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 11:58:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-26 11:58:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:58:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-11-26 11:58:39,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 58 [2023-11-26 11:58:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:39,892 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-11-26 11:58:39,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:58:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-11-26 11:58:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:58:39,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:39,897 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:39,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:58:39,897 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:39,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash 657847349, now seen corresponding path program 1 times [2023-11-26 11:58:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881688782] [2023-11-26 11:58:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:39,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:58:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:58:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:58:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:58:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:58:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:58:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:58:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:58:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:58:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:58:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881688782] [2023-11-26 11:58:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881688782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509167724] [2023-11-26 11:58:40,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:40,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:58:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:58:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:40,466 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:58:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:40,674 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-26 11:58:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-11-26 11:58:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:40,677 INFO L225 Difference]: With dead ends: 94 [2023-11-26 11:58:40,677 INFO L226 Difference]: Without dead ends: 63 [2023-11-26 11:58:40,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:58:40,680 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:40,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 152 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:58:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-26 11:58:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-26 11:58:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:58:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2023-11-26 11:58:40,722 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 58 [2023-11-26 11:58:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:40,723 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2023-11-26 11:58:40,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:58:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2023-11-26 11:58:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 11:58:40,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:40,726 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:40,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:58:40,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:40,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1806698778, now seen corresponding path program 1 times [2023-11-26 11:58:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733069139] [2023-11-26 11:58:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:40,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:58:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:58:40,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:58:40,877 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:58:40,878 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:58:40,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:58:40,884 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-26 11:58:40,887 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:58:40,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:58:40 BoogieIcfgContainer [2023-11-26 11:58:40,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:58:40,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:58:40,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:58:40,940 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:58:40,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:39" (3/4) ... [2023-11-26 11:58:40,943 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:58:40,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:58:40,946 INFO L158 Benchmark]: Toolchain (without parser) took 2636.55ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 123.7MB in the beginning and 154.2MB in the end (delta: -30.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2023-11-26 11:58:40,946 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 163.6MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:40,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.48ms. Allocated memory is still 163.6MB. Free memory was 123.4MB in the beginning and 111.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:58:40,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.07ms. Allocated memory is still 163.6MB. Free memory was 111.5MB in the beginning and 109.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:40,948 INFO L158 Benchmark]: Boogie Preprocessor took 46.36ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:58:40,949 INFO L158 Benchmark]: RCFGBuilder took 466.96ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 91.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 11:58:40,949 INFO L158 Benchmark]: TraceAbstraction took 1678.68ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 90.9MB in the beginning and 155.2MB in the end (delta: -64.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:40,950 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 222.3MB. Free memory was 155.2MB in the beginning and 154.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:58:40,953 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.29ms. Allocated memory is still 163.6MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.48ms. Allocated memory is still 163.6MB. Free memory was 123.4MB in the beginning and 111.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.07ms. Allocated memory is still 163.6MB. Free memory was 111.5MB in the beginning and 109.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.36ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.96ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 91.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1678.68ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 90.9MB in the beginning and 155.2MB in the end (delta: -64.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 222.3MB. Free memory was 155.2MB in the beginning and 154.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 19]: 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 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned short int var_1_3 = 16; [L24] unsigned long int var_1_7 = 1000; [L25] signed char var_1_8 = -4; [L26] signed short int var_1_9 = 2; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_11 = 0; [L29] double var_1_12 = 0.95; [L30] double var_1_13 = 9.8; [L31] signed short int last_1_var_1_9 = 2; [L32] unsigned char last_1_var_1_10 = 1; [L87] isInitial = 1 [L88] FCALL initially() [L89] int k_loop; [L90] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L90] COND TRUE k_loop < 1 [L91] CALL updateLastVariables() [L79] last_1_var_1_9 = var_1_9 [L80] last_1_var_1_10 = var_1_10 [L91] RET updateLastVariables() [L92] CALL updateVariables() [L63] var_1_3 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L69] var_1_8 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L70] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L72] var_1_11 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L92] RET updateVariables() [L93] CALL step() [L36] signed long int stepLocal_2 = last_1_var_1_9; [L37] unsigned char stepLocal_1 = (- var_1_7) <= last_1_var_1_9; [L38] unsigned char stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=0, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L39] COND TRUE stepLocal_0 || ((~ last_1_var_1_9) >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=0, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L40] COND FALSE !(last_1_var_1_9 < stepLocal_2) [L49] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=0, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-1, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L54] var_1_10 = var_1_11 [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=0, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L56] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=0, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L93] RET step() [L94] CALL, EXPR property() [L83-L84] return ((((last_1_var_1_10 || ((~ last_1_var_1_9) >= last_1_var_1_9)) ? ((last_1_var_1_9 < last_1_var_1_9) ? ((! last_1_var_1_10) ? (((last_1_var_1_9 > last_1_var_1_9) && ((- var_1_7) <= last_1_var_1_9)) ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_8))) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && (var_1_10 ? ((((4131182089u - var_1_3) - 200u) < var_1_1) ? (var_1_9 == ((signed short int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) var_1_13)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_3=0, var_1_7=4294967293, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-1, var_1_3=0, var_1_7=4294967293, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 80 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 288/288 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-26 11:58:40,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme --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 b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:58:43,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:58:43,732 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:58:43,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:58:43,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:58:43,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:58:43,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:58:43,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:58:43,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:58:43,797 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:58:43,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:58:43,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:58:43,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:58:43,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:58:43,802 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:58:43,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:58:43,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:58:43,804 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:58:43,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:58:43,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:58:43,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:58:43,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:58:43,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:58:43,807 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:58:43,807 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:58:43,808 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:58:43,808 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:58:43,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:58:43,809 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:58:43,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:58:43,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:58:43,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:58:43,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:58:43,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:43,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:58:43,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:58:43,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:58:43,814 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:58:43,815 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:58:43,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:58:43,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:58:43,816 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:58:43,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:58:43,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:58:43,817 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:58:43,817 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_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme 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 -> b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e [2023-11-26 11:58:44,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:58:44,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:58:44,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:58:44,282 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:58:44,282 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:58:44,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-26 11:58:47,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:58:47,758 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:58:47,758 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-26 11:58:47,773 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data/b293c5948/d4b9fd20f7ac48a5b466c1e684d4d50d/FLAG255119321 [2023-11-26 11:58:47,795 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/data/b293c5948/d4b9fd20f7ac48a5b466c1e684d4d50d [2023-11-26 11:58:47,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:58:47,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:58:47,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:47,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:58:47,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:58:47,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:47" (1/1) ... [2023-11-26 11:58:47,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55be9ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:47, skipping insertion in model container [2023-11-26 11:58:47,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:47" (1/1) ... [2023-11-26 11:58:47,859 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:58:48,021 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_3e3d722a-ff56-4817-b9b7-486f9d6656af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-26 11:58:48,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:48,079 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:58:48,095 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_3e3d722a-ff56-4817-b9b7-486f9d6656af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-26 11:58:48,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:48,136 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:48,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48 WrapperNode [2023-11-26 11:58:48,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:48,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:48,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:48,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:48,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,187 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2023-11-26 11:58:48,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:48,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:48,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:48,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:48,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,221 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-26 11:58:48,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:48,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:48,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:48,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:48,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (1/1) ... [2023-11-26 11:58:48,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:48,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:58:48,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:58:48,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:58:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:58:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:58:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:48,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:48,461 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:48,464 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:48,686 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:48,793 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:48,797 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:58:48,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:48 BoogieIcfgContainer [2023-11-26 11:58:48,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:48,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:48,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:48,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:48,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:47" (1/3) ... [2023-11-26 11:58:48,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc4ec78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:48, skipping insertion in model container [2023-11-26 11:58:48,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:48" (2/3) ... [2023-11-26 11:58:48,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc4ec78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:48, skipping insertion in model container [2023-11-26 11:58:48,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:48" (3/3) ... [2023-11-26 11:58:48,813 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-26 11:58:48,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:48,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:58:48,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:48,920 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;@1ae8508f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:48,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:58:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:58:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:58:48,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:48,940 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:48,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:48,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash 517505527, now seen corresponding path program 1 times [2023-11-26 11:58:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598714762] [2023-11-26 11:58:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:48,969 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-26 11:58:48,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:48,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:49,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:49,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:58:49,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-26 11:58:49,257 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:49,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598714762] [2023-11-26 11:58:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598714762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:49,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936769868] [2023-11-26 11:58:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:49,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:58:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:58:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:58:49,317 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:58:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:49,364 INFO L93 Difference]: Finished difference Result 67 states and 110 transitions. [2023-11-26 11:58:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:58:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2023-11-26 11:58:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:49,377 INFO L225 Difference]: With dead ends: 67 [2023-11-26 11:58:49,378 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 11:58:49,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 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-26 11:58:49,388 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:49,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:58:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 11:58:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-26 11:58:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:58:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-11-26 11:58:49,434 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 58 [2023-11-26 11:58:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:49,435 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-11-26 11:58:49,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:58:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-11-26 11:58:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:58:49,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:49,439 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:49,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:49,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:49,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:49,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash 657847349, now seen corresponding path program 1 times [2023-11-26 11:58:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:49,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776968122] [2023-11-26 11:58:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:49,649 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-26 11:58:49,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:49,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:49,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:49,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:58:49,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:58:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:58:50,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:58:50,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:58:50,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776968122] [2023-11-26 11:58:50,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776968122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:50,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:50,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:58:50,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650424483] [2023-11-26 11:58:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:50,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:58:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:58:50,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:58:50,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:58:50,011 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:58:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:58:50,319 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-26 11:58:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-11-26 11:58:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:58:50,324 INFO L225 Difference]: With dead ends: 94 [2023-11-26 11:58:50,327 INFO L226 Difference]: Without dead ends: 63 [2023-11-26 11:58:50,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:58:50,331 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:58:50,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 152 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:58:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-26 11:58:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-26 11:58:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:58:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2023-11-26 11:58:50,372 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 58 [2023-11-26 11:58:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:58:50,373 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2023-11-26 11:58:50,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:58:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2023-11-26 11:58:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 11:58:50,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:58:50,381 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:50,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 11:58:50,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:50,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:58:50,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:50,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1806698778, now seen corresponding path program 1 times [2023-11-26 11:58:50,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:58:50,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782041452] [2023-11-26 11:58:50,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:50,587 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-26 11:58:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:58:50,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:50,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:58:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:50,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-26 11:58:50,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:59:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-26 11:59:00,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:59:00,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:59:00,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782041452] [2023-11-26 11:59:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782041452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:59:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:59:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 11:59:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042223330] [2023-11-26 11:59:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:59:00,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:59:00,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:59:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:59:00,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:59:00,745 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:59:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:59:02,351 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2023-11-26 11:59:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 11:59:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-11-26 11:59:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:59:02,355 INFO L225 Difference]: With dead ends: 125 [2023-11-26 11:59:02,356 INFO L226 Difference]: Without dead ends: 94 [2023-11-26 11:59:02,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2023-11-26 11:59:02,359 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 80 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:59:02,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 139 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:59:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-26 11:59:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2023-11-26 11:59:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-26 11:59:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2023-11-26 11:59:02,380 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 59 [2023-11-26 11:59:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:59:02,381 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2023-11-26 11:59:02,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:59:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2023-11-26 11:59:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-26 11:59:02,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:59:02,384 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:59:02,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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)] Forceful destruction successful, exit code 0 [2023-11-26 11:59:02,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:59:02,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:59:02,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:59:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash 45949950, now seen corresponding path program 1 times [2023-11-26 11:59:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:59:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421070166] [2023-11-26 11:59:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:59:02,590 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-26 11:59:02,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:59:02,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:59:02,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 11:59:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:59:02,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:59:02,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:59:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:59:02,851 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:59:02,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:59:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421070166] [2023-11-26 11:59:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421070166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:59:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:59:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:59:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852258811] [2023-11-26 11:59:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:59:02,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:59:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:59:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:59:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:59:02,856 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:59:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:59:03,029 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2023-11-26 11:59:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:59:03,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-26 11:59:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:59:03,032 INFO L225 Difference]: With dead ends: 123 [2023-11-26 11:59:03,032 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 11:59:03,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:59:03,035 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:59:03,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:59:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 11:59:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 11:59:03,039 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-26 11:59:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 11:59:03,040 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2023-11-26 11:59:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:59:03,040 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:59:03,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:59:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:59:03,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 11:59:03,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:59:03,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:59:03,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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-26 11:59:03,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 11:59:04,460 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:59:04,461 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:59:04,461 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-11-26 11:59:04,461 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-26 11:59:04,461 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-26 11:59:04,461 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-26 11:59:04,461 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:59:04,462 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:59:04,462 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 50) no Hoare annotation was computed. [2023-11-26 11:59:04,462 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-26 11:59:04,462 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-11-26 11:59:04,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-26 11:59:04,463 INFO L895 garLoopResultBuilder]: At program point L90-3(lines 90 96) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:59:04,463 INFO L899 garLoopResultBuilder]: For program point L90-4(lines 90 96) no Hoare annotation was computed. [2023-11-26 11:59:04,463 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-26 11:59:04,463 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 47) no Hoare annotation was computed. [2023-11-26 11:59:04,463 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:59:04,464 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:59:04,464 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 11:59:04,464 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-26 11:59:04,464 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 11:59:04,464 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-26 11:59:04,464 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:59:04,465 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:59:04,465 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:59:04,465 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 62 77) no Hoare annotation was computed. [2023-11-26 11:59:04,465 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 53) no Hoare annotation was computed. [2023-11-26 11:59:04,465 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 53) no Hoare annotation was computed. [2023-11-26 11:59:04,465 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-26 11:59:04,466 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 61) no Hoare annotation was computed. [2023-11-26 11:59:04,466 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-26 11:59:04,466 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-26 11:59:04,466 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-26 11:59:04,466 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-26 11:59:04,477 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 11:59:04,479 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:59:04,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:59:04,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:59:04 BoogieIcfgContainer [2023-11-26 11:59:04,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:59:04,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:59:04,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:59:04,499 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:59:04,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:48" (3/4) ... [2023-11-26 11:59:04,501 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:59:04,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-26 11:59:04,511 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-26 11:59:04,511 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-26 11:59:04,512 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 11:59:04,512 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 11:59:04,634 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:59:04,634 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:59:04,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:59:04,635 INFO L158 Benchmark]: Toolchain (without parser) took 16830.86ms. Allocated memory was 75.5MB in the beginning and 406.8MB in the end (delta: 331.4MB). Free memory was 51.1MB in the beginning and 201.1MB in the end (delta: -150.0MB). Peak memory consumption was 182.6MB. Max. memory is 16.1GB. [2023-11-26 11:59:04,636 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 75.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:59:04,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.27ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 38.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:59:04,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.17ms. Allocated memory is still 75.5MB. Free memory was 38.3MB in the beginning and 36.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:59:04,637 INFO L158 Benchmark]: Boogie Preprocessor took 70.79ms. Allocated memory is still 75.5MB. Free memory was 36.7MB in the beginning and 33.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:59:04,638 INFO L158 Benchmark]: RCFGBuilder took 538.47ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 33.9MB in the beginning and 58.6MB in the end (delta: -24.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-26 11:59:04,638 INFO L158 Benchmark]: TraceAbstraction took 15696.65ms. Allocated memory was 94.4MB in the beginning and 406.8MB in the end (delta: 312.5MB). Free memory was 57.9MB in the beginning and 206.3MB in the end (delta: -148.5MB). Peak memory consumption was 163.7MB. Max. memory is 16.1GB. [2023-11-26 11:59:04,639 INFO L158 Benchmark]: Witness Printer took 136.61ms. Allocated memory is still 406.8MB. Free memory was 206.3MB in the beginning and 201.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:59:04,643 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.36ms. Allocated memory is still 75.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.27ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 38.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.17ms. Allocated memory is still 75.5MB. Free memory was 38.3MB in the beginning and 36.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.79ms. Allocated memory is still 75.5MB. Free memory was 36.7MB in the beginning and 33.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.47ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 33.9MB in the beginning and 58.6MB in the end (delta: -24.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15696.65ms. Allocated memory was 94.4MB in the beginning and 406.8MB in the end (delta: 312.5MB). Free memory was 57.9MB in the beginning and 206.3MB in the end (delta: -148.5MB). Peak memory consumption was 163.7MB. Max. memory is 16.1GB. * Witness Printer took 136.61ms. Allocated memory is still 406.8MB. Free memory was 206.3MB in the beginning and 201.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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: 19]: 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 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 142 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 68 PreInvPairs, 88 NumberOfFragments, 679 HoareAnnotationTreeSize, 68 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 904 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 851 SizeOfPredicates, 21 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: (((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (last_1_var_1_9 == 2)) && (var_1_13 == var_1_12)) && (var_1_11 <= 0)) && (var_1_10 == var_1_11)) || (((((var_1_9 == 2) && (last_1_var_1_9 == 2)) && (var_1_11 <= 0)) && (last_1_var_1_10 == 1)) && (1 == var_1_10))) RESULT: Ultimate proved your program to be correct! [2023-11-26 11:59:04,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3d722a-ff56-4817-b9b7-486f9d6656af/bin/uautomizer-verify-VRDe98Ueme/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 Writing output log to file Ultimate.log Result: TRUE