./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 4f9f01bde8fda2c75630f127009f2a9b60883250862a9d96b52c34a46b69c1e5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:21:42,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:21:42,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:21:42,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:21:42,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:21:42,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:21:42,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:21:42,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:21:42,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:21:42,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:21:42,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:21:42,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:21:42,814 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:21:42,814 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:21:42,815 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:21:42,815 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:21:42,815 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:21:42,816 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:21:42,816 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:21:42,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:21:42,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:21:42,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:21:42,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:21:42,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:21:42,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:21:42,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:21:42,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:21:42,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:21:42,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:21:42,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:21:42,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:21:42,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:21:42,823 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:21:42,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:21:42,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:21:42,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:21:42,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:21:42,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:21:42,826 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:21:42,827 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f9f01bde8fda2c75630f127009f2a9b60883250862a9d96b52c34a46b69c1e5 [2024-10-13 17:21:43,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:21:43,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:21:43,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:21:43,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:21:43,107 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:21:43,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c [2024-10-13 17:21:44,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:21:44,796 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:21:44,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c [2024-10-13 17:21:44,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54757ffca/40e1011dcf7041579bb51b87903f8053/FLAG80fe7c40a [2024-10-13 17:21:44,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54757ffca/40e1011dcf7041579bb51b87903f8053 [2024-10-13 17:21:44,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:21:44,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:21:44,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:21:44,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:21:44,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:21:44,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:21:44" (1/1) ... [2024-10-13 17:21:44,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aff1612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:44, skipping insertion in model container [2024-10-13 17:21:44,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:21:44" (1/1) ... [2024-10-13 17:21:44,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:21:45,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:21:45,112 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:21:45,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:21:45,156 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:21:45,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45 WrapperNode [2024-10-13 17:21:45,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:21:45,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:21:45,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:21:45,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:21:45,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,194 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 259 [2024-10-13 17:21:45,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:21:45,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:21:45,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:21:45,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:21:45,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,223 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]. [2024-10-13 17:21:45,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:21:45,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:21:45,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:21:45,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:21:45,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (1/1) ... [2024-10-13 17:21:45,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:21:45,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:21:45,271 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-10-13 17:21:45,278 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-10-13 17:21:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:21:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:21:45,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:21:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:21:45,402 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:21:45,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:21:45,702 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-10-13 17:21:45,702 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:21:45,719 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:21:45,721 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 17:21:45,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:21:45 BoogieIcfgContainer [2024-10-13 17:21:45,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:21:45,723 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:21:45,723 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:21:45,726 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:21:45,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:21:45,727 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:21:44" (1/3) ... [2024-10-13 17:21:45,728 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50aa03c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:21:45, skipping insertion in model container [2024-10-13 17:21:45,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:21:45,728 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:21:45" (2/3) ... [2024-10-13 17:21:45,729 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50aa03c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:21:45, skipping insertion in model container [2024-10-13 17:21:45,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:21:45,729 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:21:45" (3/3) ... [2024-10-13 17:21:45,731 INFO L332 chiAutomizerObserver]: Analyzing ICFG psyco_io_1.c [2024-10-13 17:21:45,789 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:21:45,790 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:21:45,790 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:21:45,790 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:21:45,790 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:21:45,790 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:21:45,791 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:21:45,791 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:21:45,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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-10-13 17:21:45,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2024-10-13 17:21:45,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:21:45,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:21:45,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:21:45,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:21:45,829 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:21:45,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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-10-13 17:21:45,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2024-10-13 17:21:45,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:21:45,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:21:45,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:21:45,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:21:45,892 INFO L745 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_sink~0#1, main_~this_sinkConnected~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_sink~0#1 := 0;main_~this_sinkConnected~0#1 := 0; 10#L25-2true [2024-10-13 17:21:45,896 INFO L747 eck$LassoCheckResult]: Loop: 10#L25-2true goto; 35#L290-2true assume !false;havoc main_#t~nondet4#1;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 43#L35true assume !(0 == main_~q~0#1); 56#L55true assume !(1 == main_~q~0#1); 53#L107true assume !(2 == main_~q~0#1); 67#L223true assume !(3 == main_~q~0#1);havoc main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1; 10#L25-2true [2024-10-13 17:21:45,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:21:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:21:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:21:45,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99387390] [2024-10-13 17:21:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:21:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:21:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:21:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:21:46,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:21:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1070475851, now seen corresponding path program 1 times [2024-10-13 17:21:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:21:46,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701144536] [2024-10-13 17:21:46,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:21:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:21:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:21:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:21:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:21:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 150525069, now seen corresponding path program 1 times [2024-10-13 17:21:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:21:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269603020] [2024-10-13 17:21:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:21:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:21:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:21:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:21:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:21:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269603020] [2024-10-13 17:21:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269603020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:21:46,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:21:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:21:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734929083] [2024-10-13 17:21:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:21:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:21:46,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:21:46,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:21:46,292 INFO L87 Difference]: Start difference. First operand has 68 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:21:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:21:46,357 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2024-10-13 17:21:46,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 102 transitions. [2024-10-13 17:21:46,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2024-10-13 17:21:46,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 52 states and 77 transitions. [2024-10-13 17:21:46,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-10-13 17:21:46,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-10-13 17:21:46,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 77 transitions. [2024-10-13 17:21:46,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:21:46,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-10-13 17:21:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 77 transitions. [2024-10-13 17:21:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 17:21:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 51 states have internal predecessors, (77), 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-10-13 17:21:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2024-10-13 17:21:46,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-10-13 17:21:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:21:46,406 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-10-13 17:21:46,408 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:21:46,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 77 transitions. [2024-10-13 17:21:46,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2024-10-13 17:21:46,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:21:46,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:21:46,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 17:21:46,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:21:46,413 INFO L745 eck$LassoCheckResult]: Stem: 178#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_sink~0#1, main_~this_sinkConnected~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_sink~0#1 := 0;main_~this_sinkConnected~0#1 := 0; 153#L25-2 goto; 154#L290-2 [2024-10-13 17:21:46,413 INFO L747 eck$LassoCheckResult]: Loop: 154#L290-2 assume !false;havoc main_#t~nondet4#1;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 184#L35 assume 0 == main_~q~0#1;havoc main_#t~nondet8#1; 188#L36 assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1; 154#L290-2 [2024-10-13 17:21:46,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:21:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2024-10-13 17:21:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:21:46,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112992741] [2024-10-13 17:21:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:21:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:21:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:21:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:21:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:21:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 40826, now seen corresponding path program 1 times [2024-10-13 17:21:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:21:46,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814473262] [2024-10-13 17:21:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:21:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:21:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:21:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:21:46,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:21:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash 889540504, now seen corresponding path program 1 times [2024-10-13 17:21:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:21:46,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526982698] [2024-10-13 17:21:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:21:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:21:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:21:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:21:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:21:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:21:46,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:21:46 BoogieIcfgContainer [2024-10-13 17:21:46,790 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:21:46,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:21:46,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:21:46,791 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:21:46,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:21:45" (3/4) ... [2024-10-13 17:21:46,793 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 17:21:46,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 17:21:46,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:21:46,831 INFO L158 Benchmark]: Toolchain (without parser) took 2009.35ms. Allocated memory is still 172.0MB. Free memory was 102.1MB in the beginning and 90.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-10-13 17:21:46,831 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:21:46,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.43ms. Allocated memory is still 172.0MB. Free memory was 101.6MB in the beginning and 87.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 17:21:46,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.56ms. Allocated memory is still 172.0MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:21:46,833 INFO L158 Benchmark]: Boogie Preprocessor took 41.03ms. Allocated memory is still 172.0MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:21:46,833 INFO L158 Benchmark]: RCFGBuilder took 484.31ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 65.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 17:21:46,834 INFO L158 Benchmark]: BuchiAutomizer took 1067.46ms. Allocated memory is still 172.0MB. Free memory was 64.8MB in the beginning and 92.2MB in the end (delta: -27.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:21:46,834 INFO L158 Benchmark]: Witness Printer took 39.79ms. Allocated memory is still 172.0MB. Free memory was 92.2MB in the beginning and 90.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:21:46,836 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.17ms. Allocated memory is still 121.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.43ms. Allocated memory is still 172.0MB. Free memory was 101.6MB in the beginning and 87.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.56ms. Allocated memory is still 172.0MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.03ms. Allocated memory is still 172.0MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.31ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 65.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 1067.46ms. Allocated memory is still 172.0MB. Free memory was 64.8MB in the beginning and 92.2MB in the end (delta: -27.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 39.79ms. Allocated memory is still 172.0MB. Free memory was 92.2MB in the beginning and 90.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 52 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 98 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 25]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L7] int m_flush = 1; [L8] int m_PipedOutputStream = 2; [L9] int m_close = 3; [L10] int m_write = 4; [L11] int m_connect_1 = 5; [L12] int m_connect_2 = 6; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4] [L17] int q = 0; [L18] int method_id; [L21] int this_sink = 0; [L22] int this_sinkConnected = 0; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4, q=0, this_sink=0, this_sinkConnected=0] Loop: [L25] COND TRUE 1 [L28] int P1=__VERIFIER_nondet_int(); [L29] int P2=__VERIFIER_nondet_int(); [L30] int P3=__VERIFIER_nondet_int(); [L31] int P4=__VERIFIER_nondet_int(); [L35] COND TRUE q == 0 [L36] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int m_flush = 1; [L8] int m_PipedOutputStream = 2; [L9] int m_close = 3; [L10] int m_write = 4; [L11] int m_connect_1 = 5; [L12] int m_connect_2 = 6; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4] [L17] int q = 0; [L18] int method_id; [L21] int this_sink = 0; [L22] int this_sinkConnected = 0; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4, q=0, this_sink=0, this_sinkConnected=0] Loop: [L25] COND TRUE 1 [L28] int P1=__VERIFIER_nondet_int(); [L29] int P2=__VERIFIER_nondet_int(); [L30] int P3=__VERIFIER_nondet_int(); [L31] int P4=__VERIFIER_nondet_int(); [L35] COND TRUE q == 0 [L36] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-13 17:21:46,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)