./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee7ff83d9ca4f9baaadd009c98a7dd30697b6140296199117a6b05757b5b9f74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:38:58,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:38:58,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:38:58,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:38:58,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:38:58,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:38:58,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:38:58,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:38:58,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:38:58,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:38:58,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:38:58,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:38:58,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:38:58,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:38:58,459 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:38:58,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:38:58,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:38:58,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:38:58,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:38:58,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:38:58,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:38:58,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:58,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:58,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:38:58,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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(G ! overflow) ) 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 -> ee7ff83d9ca4f9baaadd009c98a7dd30697b6140296199117a6b05757b5b9f74 [2025-01-10 02:38:58,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:38:58,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:38:58,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:38:58,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:38:58,865 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:38:58,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i [2025-01-10 02:39:00,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21f7453c9/e75bbef94e5a4fdcaa28ef8fbdda6a69/FLAG310bda10c [2025-01-10 02:39:00,709 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:39:00,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i [2025-01-10 02:39:00,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21f7453c9/e75bbef94e5a4fdcaa28ef8fbdda6a69/FLAG310bda10c [2025-01-10 02:39:00,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21f7453c9/e75bbef94e5a4fdcaa28ef8fbdda6a69 [2025-01-10 02:39:00,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:39:00,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:39:00,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:39:00,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:39:00,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:39:00,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:00" (1/1) ... [2025-01-10 02:39:00,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a133c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:00, skipping insertion in model container [2025-01-10 02:39:00,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:00" (1/1) ... [2025-01-10 02:39:00,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:39:01,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:39:01,123 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:39:01,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:39:01,219 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:39:01,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01 WrapperNode [2025-01-10 02:39:01,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:39:01,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:39:01,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:39:01,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:39:01,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,265 INFO L138 Inliner]: procedures = 145, calls = 310, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 463 [2025-01-10 02:39:01,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:39:01,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:39:01,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:39:01,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:39:01,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,307 INFO L175 MemorySlicer]: Split 158 memory accesses to 18 slices as follows [2, 8, 5, 8, 8, 29, 21, 13, 7, 7, 9, 7, 5, 13, 6, 5, 0, 5]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 3, 0, 3, 3, 9, 9, 0, 3, 3, 3, 3, 0, 0, 2, 0, 0, 0]. The 39 writes are split as follows [0, 2, 1, 2, 2, 11, 6, 1, 2, 2, 2, 2, 1, 1, 2, 1, 0, 1]. [2025-01-10 02:39:01,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:39:01,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:39:01,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:39:01,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:39:01,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (1/1) ... [2025-01-10 02:39:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:39:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:01,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:39:01,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:39:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:39:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:39:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:39:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:39:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:39:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:39:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 02:39:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 02:39:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 02:39:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-10 02:39:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 02:39:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 02:39:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 02:39:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 02:39:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 02:39:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-10 02:39:01,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:39:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-10 02:39:01,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 02:39:01,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-10 02:39:01,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-10 02:39:01,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-10 02:39:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-10 02:39:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 02:39:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 02:39:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:39:01,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:39:01,673 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:39:01,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:39:04,358 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-01-10 02:39:04,358 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:39:04,368 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:39:04,370 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:39:04,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:04 BoogieIcfgContainer [2025-01-10 02:39:04,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:39:04,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:39:04,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:39:04,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:39:04,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:39:00" (1/3) ... [2025-01-10 02:39:04,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17670aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:04, skipping insertion in model container [2025-01-10 02:39:04,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:01" (2/3) ... [2025-01-10 02:39:04,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17670aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:04, skipping insertion in model container [2025-01-10 02:39:04,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:04" (3/3) ... [2025-01-10 02:39:04,378 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_dekker_unfair.i [2025-01-10 02:39:04,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:39:04,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_dekker_unfair.i that has 6 procedures, 132 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 02:39:04,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:39:04,441 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@675d1773, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:39:04,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 02:39:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 91 states have internal predecessors, (115), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-10 02:39:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:39:04,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:04,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:39:04,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:39:04,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash 132714065, now seen corresponding path program 1 times [2025-01-10 02:39:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:04,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496626084] [2025-01-10 02:39:04,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:04,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:39:04,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:39:04,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:04,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:04,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496626084] [2025-01-10 02:39:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496626084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:04,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:04,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:39:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376010260] [2025-01-10 02:39:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:04,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:04,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:04,888 INFO L87 Difference]: Start difference. First operand has 132 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 91 states have internal predecessors, (115), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-10 02:39:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:04,972 INFO L93 Difference]: Finished difference Result 260 states and 406 transitions. [2025-01-10 02:39:04,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:04,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 02:39:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:04,977 INFO L225 Difference]: With dead ends: 260 [2025-01-10 02:39:04,977 INFO L226 Difference]: Without dead ends: 15 [2025-01-10 02:39:04,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:04,988 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:04,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 514 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-10 02:39:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-10 02:39:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 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) [2025-01-10 02:39:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-01-10 02:39:05,017 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 5 [2025-01-10 02:39:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:05,018 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-01-10 02:39:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-10 02:39:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-01-10 02:39:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:39:05,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:05,021 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:05,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:39:05,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:39:05,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1980017398, now seen corresponding path program 1 times [2025-01-10 02:39:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:05,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022144914] [2025-01-10 02:39:05,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:05,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:05,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:39:05,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:39:05,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:05,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:05,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:05,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022144914] [2025-01-10 02:39:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022144914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:05,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635166090] [2025-01-10 02:39:05,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:05,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:05,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:05,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:39:05,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:39:05,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:39:05,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:39:05,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:05,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:05,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:39:05,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:05,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635166090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:05,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 02:39:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977036682] [2025-01-10 02:39:05,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:39:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:39:05,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:39:05,460 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2025-01-10 02:39:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:05,500 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-01-10 02:39:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:39:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) Word has length 8 [2025-01-10 02:39:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:05,500 INFO L225 Difference]: With dead ends: 15 [2025-01-10 02:39:05,500 INFO L226 Difference]: Without dead ends: 14 [2025-01-10 02:39:05,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:39:05,501 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:05,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-10 02:39:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-10 02:39:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 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) [2025-01-10 02:39:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-01-10 02:39:05,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2025-01-10 02:39:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:05,503 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 02:39:05,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2025-01-10 02:39:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-01-10 02:39:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:39:05,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:05,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:05,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:39:05,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:05,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:39:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1980017206, now seen corresponding path program 1 times [2025-01-10 02:39:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430208370] [2025-01-10 02:39:05,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:05,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:39:05,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:39:05,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:05,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:39:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:06,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430208370] [2025-01-10 02:39:06,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430208370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:06,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:06,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:39:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239613624] [2025-01-10 02:39:06,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:06,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:06,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:06,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:06,002 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) [2025-01-10 02:39:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:06,093 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-01-10 02:39:06,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:06,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) Word has length 8 [2025-01-10 02:39:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:06,094 INFO L225 Difference]: With dead ends: 26 [2025-01-10 02:39:06,094 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 02:39:06,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:06,095 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:06,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 02:39:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-01-10 02:39:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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) [2025-01-10 02:39:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-01-10 02:39:06,101 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2025-01-10 02:39:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:06,102 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-01-10 02:39:06,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) [2025-01-10 02:39:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-01-10 02:39:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:39:06,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:06,102 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:39:06,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:39:06,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:39:06,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1250997041, now seen corresponding path program 1 times [2025-01-10 02:39:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039476657] [2025-01-10 02:39:06,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:06,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:39:06,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:39:06,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:06,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:39:06,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:06,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039476657] [2025-01-10 02:39:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039476657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:06,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:39:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319773940] [2025-01-10 02:39:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:06,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:06,249 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-01-10 02:39:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:06,259 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-01-10 02:39:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:06,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:39:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:06,268 INFO L225 Difference]: With dead ends: 23 [2025-01-10 02:39:06,268 INFO L226 Difference]: Without dead ends: 22 [2025-01-10 02:39:06,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:06,269 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:06,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-10 02:39:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-01-10 02:39:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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) [2025-01-10 02:39:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-10 02:39:06,274 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2025-01-10 02:39:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:06,275 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-10 02:39:06,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-01-10 02:39:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-01-10 02:39:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:39:06,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:06,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:39:06,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:39:06,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:39:06,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash -333408707, now seen corresponding path program 1 times [2025-01-10 02:39:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:06,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17634975] [2025-01-10 02:39:06,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:06,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:39:06,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:39:06,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:06,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:39:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17634975] [2025-01-10 02:39:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17634975] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182755882] [2025-01-10 02:39:06,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:06,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:06,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:39:06,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:39:06,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:39:06,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:39:06,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:06,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:06,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:39:06,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:39:06,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:39:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182755882] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:06,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-10 02:39:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198018299] [2025-01-10 02:39:06,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:06,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:39:06,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:06,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:39:06,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:39:06,895 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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) [2025-01-10 02:39:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:06,944 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-01-10 02:39:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:39:06,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:39:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:06,945 INFO L225 Difference]: With dead ends: 41 [2025-01-10 02:39:06,945 INFO L226 Difference]: Without dead ends: 30 [2025-01-10 02:39:06,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:39:06,946 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:06,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-10 02:39:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-10 02:39:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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) [2025-01-10 02:39:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-01-10 02:39:06,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2025-01-10 02:39:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:06,950 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-01-10 02:39:06,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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) [2025-01-10 02:39:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-01-10 02:39:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:39:06,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:06,951 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:39:06,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:39:07,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:07,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:39:07,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash 123697149, now seen corresponding path program 2 times [2025-01-10 02:39:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004206794] [2025-01-10 02:39:07,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:07,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 02:39:07,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:39:07,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:39:07,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004206794] [2025-01-10 02:39:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004206794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342937232] [2025-01-10 02:39:07,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:07,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:07,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:07,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:39:07,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:39:07,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 02:39:07,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:39:07,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:39:07,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:07,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:39:07,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:07,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342937232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:07,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:07,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:39:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427565936] [2025-01-10 02:39:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:07,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:07,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:07,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:39:07,817 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2025-01-10 02:39:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:07,843 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-01-10 02:39:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:07,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-10 02:39:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:07,844 INFO L225 Difference]: With dead ends: 30 [2025-01-10 02:39:07,844 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 02:39:07,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:39:07,845 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:07,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 02:39:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 02:39:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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) [2025-01-10 02:39:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-01-10 02:39:07,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2025-01-10 02:39:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:07,849 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-01-10 02:39:07,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2025-01-10 02:39:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-01-10 02:39:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:39:07,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:07,849 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 02:39:07,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:39:08,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:08,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:39:08,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash -460355518, now seen corresponding path program 1 times [2025-01-10 02:39:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669887212] [2025-01-10 02:39:08,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:08,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:39:08,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:39:08,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:08,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 02:39:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669887212] [2025-01-10 02:39:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669887212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:08,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:08,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:39:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620812004] [2025-01-10 02:39:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:08,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:08,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:08,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:08,232 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-01-10 02:39:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:08,255 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-01-10 02:39:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:08,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-10 02:39:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:08,256 INFO L225 Difference]: With dead ends: 29 [2025-01-10 02:39:08,256 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:39:08,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:08,256 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:08,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:39:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:39:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:39:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:39:08,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-01-10 02:39:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:08,258 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:39:08,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-01-10 02:39:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:39:08,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:39:08,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 02:39:08,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 02:39:08,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 02:39:08,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 02:39:08,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 02:39:08,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 02:39:08,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 02:39:08,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 02:39:08,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:39:08,266 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 02:39:08,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:39:08,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:39:08,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:39:08 BoogieIcfgContainer [2025-01-10 02:39:08,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:39:08,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:39:08,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:39:08,426 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:39:08,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:04" (3/4) ... [2025-01-10 02:39:08,428 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:39:08,435 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-01-10 02:39:08,435 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-10 02:39:08,435 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-01-10 02:39:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-10 02:39:08,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-01-10 02:39:08,447 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-01-10 02:39:08,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 02:39:08,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 02:39:08,449 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 02:39:08,453 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:39:08,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:39:08,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:39:08,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:39:08,597 INFO L158 Benchmark]: Toolchain (without parser) took 7843.39ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 103.5MB in the beginning and 216.5MB in the end (delta: -113.1MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2025-01-10 02:39:08,597 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:08,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.43ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 75.7MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:39:08,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.21ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 71.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:08,597 INFO L158 Benchmark]: Boogie Preprocessor took 87.11ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 64.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:08,597 INFO L158 Benchmark]: RCFGBuilder took 3016.63ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 76.0MB in the end (delta: -11.6MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2025-01-10 02:39:08,597 INFO L158 Benchmark]: TraceAbstraction took 4049.50ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 75.3MB in the beginning and 227.9MB in the end (delta: -152.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2025-01-10 02:39:08,597 INFO L158 Benchmark]: Witness Printer took 170.09ms. Allocated memory is still 302.0MB. Free memory was 227.9MB in the beginning and 216.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:08,598 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.43ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 75.7MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.21ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 71.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.11ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 64.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3016.63ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 76.0MB in the end (delta: -11.6MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4049.50ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 75.3MB in the beginning and 227.9MB in the end (delta: -152.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Witness Printer took 170.09ms. Allocated memory is still 302.0MB. Free memory was 227.9MB in the beginning and 216.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 805]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 805]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 800]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 800]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 132 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 619 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 213 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1533 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 178/219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 800]: Loop Invariant Derived loop invariant: (0 < (2147483649 + i)) - InvariantResult [Line: 805]: Loop Invariant Derived loop invariant: ((((i <= 2) && (0 <= (i + 2147483648))) && (j == 0)) || (((i <= 2) && (0 <= (i + 2147483648))) && (1 <= j))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:39:08,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE