./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:58:45,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:58:45,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-12 20:58:45,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:58:45,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:58:46,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:58:46,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:58:46,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:58:46,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:58:46,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:58:46,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:58:46,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:58:46,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:58:46,034 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 20:58:46,043 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 20:58:46,043 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 20:58:46,043 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 20:58:46,043 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 20:58:46,044 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 20:58:46,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:58:46,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 20:58:46,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:58:46,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:58:46,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 20:58:46,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 20:58:46,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 20:58:46,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:58:46,050 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:58:46,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:58:46,051 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 20:58:46,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:58:46,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:58:46,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:58:46,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:58:46,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:58:46,054 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 20:58:46,054 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c [2024-11-12 20:58:46,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:58:46,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:58:46,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:58:46,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:58:46,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:58:46,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-11-12 20:58:47,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:58:48,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:58:48,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-11-12 20:58:48,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2890a9b64/c378fa104a214a6aa5dd49dfec8dfcf4/FLAGb53faa98b [2024-11-12 20:58:48,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2890a9b64/c378fa104a214a6aa5dd49dfec8dfcf4 [2024-11-12 20:58:48,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:58:48,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:58:48,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:58:48,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:58:48,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:58:48,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53fbf264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48, skipping insertion in model container [2024-11-12 20:58:48,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:58:48,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:58:48,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:58:48,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:58:48,453 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:58:48,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48 WrapperNode [2024-11-12 20:58:48,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:58:48,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:58:48,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:58:48,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:58:48,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,500 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2024-11-12 20:58:48,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:58:48,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:58:48,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:58:48,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:58:48,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,526 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [8, 4, 7, 8]. 30 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 9 writes are split as follows [3, 1, 2, 3]. [2024-11-12 20:58:48,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:58:48,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:58:48,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:58:48,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:58:48,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (1/1) ... [2024-11-12 20:58:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:58:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:48,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:58:48,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-12 20:58:48,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:58:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:58:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:58:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 20:58:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:58:48,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:58:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:58:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 20:58:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:58:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:58:48,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:58:48,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:58:48,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:58:48,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:58:48,932 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-12 20:58:48,932 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:58:48,948 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:58:48,948 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 20:58:48,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:48 BoogieIcfgContainer [2024-11-12 20:58:48,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:58:48,949 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 20:58:48,950 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 20:58:48,953 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 20:58:48,954 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:48,954 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 08:58:48" (1/3) ... [2024-11-12 20:58:48,955 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ca5aeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:58:48, skipping insertion in model container [2024-11-12 20:58:48,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:48,955 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:58:48" (2/3) ... [2024-11-12 20:58:48,956 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ca5aeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:58:48, skipping insertion in model container [2024-11-12 20:58:48,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:58:48,956 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:58:48" (3/3) ... [2024-11-12 20:58:48,957 INFO L332 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2024-11-12 20:58:49,016 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 20:58:49,016 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 20:58:49,016 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 20:58:49,016 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 20:58:49,016 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 20:58:49,016 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 20:58:49,016 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 20:58:49,017 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 20:58:49,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) [2024-11-12 20:58:49,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 20:58:49,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:49,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:49,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:58:49,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:58:49,041 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 20:58:49,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) [2024-11-12 20:58:49,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 20:58:49,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:58:49,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:58:49,043 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:58:49,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:58:49,050 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" [2024-11-12 20:58:49,051 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" [2024-11-12 20:58:49,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 20:58:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822306131] [2024-11-12 20:58:49,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:49,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:49,261 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:49,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:49,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2024-11-12 20:58:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686920750] [2024-11-12 20:58:49,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:58:49,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872162967] [2024-11-12 20:58:49,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:49,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:49,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:49,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:49,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:58:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:49,500 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:58:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:58:49,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:58:49,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:58:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2024-11-12 20:58:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:58:49,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503579908] [2024-11-12 20:58:49,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:58:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:50,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:58:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503579908] [2024-11-12 20:58:50,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503579908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:58:50,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367846022] [2024-11-12 20:58:50,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:58:50,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:58:50,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:58:50,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:58:50,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:58:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:58:50,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 20:58:50,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:58:50,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 20:58:50,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 20:58:50,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 20:58:50,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 20:58:50,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:58:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367846022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:58:50,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:58:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-12 20:58:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853704270] [2024-11-12 20:58:50,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:59:03,397 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 20:59:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:59:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:59:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:59:03,785 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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) [2024-11-12 20:59:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:59:03,874 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-12 20:59:03,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2024-11-12 20:59:03,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 20:59:03,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 22 transitions. [2024-11-12 20:59:03,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-12 20:59:03,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-12 20:59:03,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-12 20:59:03,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:59:03,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 20:59:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-12 20:59:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-12 20:59:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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) [2024-11-12 20:59:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-12 20:59:03,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 20:59:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:59:03,905 INFO L426 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 20:59:03,905 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 20:59:03,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-12 20:59:03,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-12 20:59:03,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:59:03,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:59:03,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:03,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:59:03,907 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2024-11-12 20:59:03,907 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume !false;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2024-11-12 20:59:03,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1398915161, now seen corresponding path program 1 times [2024-11-12 20:59:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:03,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447271081] [2024-11-12 20:59:03,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:59:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679543011] [2024-11-12 20:59:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:03,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:03,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:03,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:03,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:59:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:04,047 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:59:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:59:04,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:59:04,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:59:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 2 times [2024-11-12 20:59:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:59:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886070428] [2024-11-12 20:59:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:59:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:59:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:59:04,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704252531] [2024-11-12 20:59:04,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:59:04,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:59:04,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:59:04,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:59:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 20:59:04,162 ERROR L251 FreeRefinementEngine]: Caught unknown exception: Counterexample with control configurations is required, but this counterexample does not have control configurations. [2024-11-12 20:59:04,163 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-12 20:59:04,163 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalStateException: Counterexample with control configurations is required, but this counterexample does not have control configurations. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.Counterexample.requireControlConfigurations(Counterexample.java:115) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.Counterexample.getControlConfigurations(Counterexample.java:127) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedFormulas.getControlConfigurations(NestedFormulas.java:77) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserterWithStmtOrderPrioritization.(AnnotateAndAsserterWithStmtOrderPrioritization.java:105) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:309) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:216) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:880) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:842) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:762) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-12 20:59:04,166 INFO L158 Benchmark]: Toolchain (without parser) took 16114.91ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 119.4MB in the beginning and 102.9MB in the end (delta: 16.6MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-11-12 20:59:04,167 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory was 122.4MB in the beginning and 122.3MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:59:04,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.38ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 100.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 20:59:04,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.96ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 98.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:59:04,168 INFO L158 Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:59:04,168 INFO L158 Benchmark]: RCFGBuilder took 409.39ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 113.2MB in the end (delta: -16.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 20:59:04,169 INFO L158 Benchmark]: BuchiAutomizer took 15216.08ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 113.2MB in the beginning and 102.9MB in the end (delta: 10.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2024-11-12 20:59:04,171 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.21ms. Allocated memory is still 155.2MB. Free memory was 122.4MB in the beginning and 122.3MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.38ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 100.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.96ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 98.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.81ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.39ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 113.2MB in the end (delta: -16.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 15216.08ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 113.2MB in the beginning and 102.9MB in the end (delta: 10.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalStateException: Counterexample with control configurations is required, but this counterexample does not have control configurations. de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalStateException: Counterexample with control configurations is required, but this counterexample does not have control configurations.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.Counterexample.requireControlConfigurations(Counterexample.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-12 20:59:04,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:04,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 20:59:04,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 20:59:04,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:59:05,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Counterexample with control configurations is required, but this counterexample does not have control configurations.