./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-pthread/cs_dekker.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_dekker.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:48:03,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:03,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:48:03,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:03,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:03,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:03,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:03,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:03,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:03,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:03,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:03,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:03,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:03,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:03,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:03,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:03,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:03,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:03,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:03,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:03,872 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/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 -> 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 [2025-03-09 02:48:04,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:04,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:04,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:04,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:04,104 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:04,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-03-09 02:48:05,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71725caeb/f8a474623e054c52a408bf098bcbc094/FLAGce81893a6 [2025-03-09 02:48:05,509 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:48:05,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-03-09 02:48:05,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71725caeb/f8a474623e054c52a408bf098bcbc094/FLAGce81893a6 [2025-03-09 02:48:05,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71725caeb/f8a474623e054c52a408bf098bcbc094 [2025-03-09 02:48:05,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:48:05,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:48:05,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:05,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:48:05,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:48:05,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:05" (1/1) ... [2025-03-09 02:48:05,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0c283b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:05, skipping insertion in model container [2025-03-09 02:48:05,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:05" (1/1) ... [2025-03-09 02:48:05,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:48:05,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:05,906 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:48:05,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:06,005 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:48:06,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06 WrapperNode [2025-03-09 02:48:06,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:06,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:06,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:48:06,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:48:06,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,048 INFO L138 Inliner]: procedures = 145, calls = 310, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 463 [2025-03-09 02:48:06,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:06,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:48:06,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:48:06,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:48:06,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,089 INFO L175 MemorySlicer]: Split 158 memory accesses to 18 slices as follows [2, 8, 8, 8, 29, 21, 7, 5, 7, 9, 7, 5, 5, 13, 0, 6, 13, 5]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 3, 3, 3, 9, 9, 3, 0, 3, 3, 3, 0, 0, 0, 0, 2, 0, 0]. The 39 writes are split as follows [0, 2, 2, 2, 11, 6, 2, 1, 2, 2, 2, 1, 1, 1, 0, 2, 1, 1]. [2025-03-09 02:48:06,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:48:06,134 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:48:06,134 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:48:06,134 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:48:06,135 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (1/1) ... [2025-03-09 02:48:06,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:06,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:06,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:48:06,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:48:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:48:06,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 02:48:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-09 02:48:06,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-09 02:48:06,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-09 02:48:06,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 02:48:06,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-09 02:48:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:48:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-09 02:48:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:06,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:06,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:06,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:07,613 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:07,613 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:07,623 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:07,623 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:48:07,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:07 BoogieIcfgContainer [2025-03-09 02:48:07,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:07,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:07,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:07,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:07,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:48:05" (1/3) ... [2025-03-09 02:48:07,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436b940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:07, skipping insertion in model container [2025-03-09 02:48:07,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:06" (2/3) ... [2025-03-09 02:48:07,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436b940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:07, skipping insertion in model container [2025-03-09 02:48:07,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:07" (3/3) ... [2025-03-09 02:48:07,634 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_dekker.i [2025-03-09 02:48:07,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:07,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_dekker.i that has 6 procedures, 132 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-09 02:48:07,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:07,700 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;@29f9941a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:07,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 02:48:07,705 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-03-09 02:48:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 02:48:07,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:07,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 02:48:07,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:48:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 191783336, now seen corresponding path program 1 times [2025-03-09 02:48:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306613902] [2025-03-09 02:48:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:07,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 02:48:07,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 02:48:07,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:07,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306613902] [2025-03-09 02:48:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306613902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:07,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799887482] [2025-03-09 02:48:07,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:07,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:07,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:07,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:07,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:08,001 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03-09 02:48:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:08,082 INFO L93 Difference]: Finished difference Result 258 states and 402 transitions. [2025-03-09 02:48:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03-09 02:48:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:08,087 INFO L225 Difference]: With dead ends: 258 [2025-03-09 02:48:08,088 INFO L226 Difference]: Without dead ends: 13 [2025-03-09 02:48:08,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03-09 02:48:08,093 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:08,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-09 02:48:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-09 02:48:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 12 states have internal predecessors, (14), 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-03-09 02:48:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-09 02:48:08,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 5 [2025-03-09 02:48:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:08,114 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-09 02:48:08,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03-09 02:48:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-09 02:48:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 02:48:08,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:08,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 02:48:08,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:48:08,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:48:08,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash 191783496, now seen corresponding path program 1 times [2025-03-09 02:48:08,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:08,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289613705] [2025-03-09 02:48:08,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:08,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:08,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 02:48:08,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 02:48:08,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:08,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289613705] [2025-03-09 02:48:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289613705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:08,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419917014] [2025-03-09 02:48:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:08,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:08,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:08,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:08,300 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. 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-03-09 02:48:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:08,333 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-09 02:48:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:08,334 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-03-09 02:48:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:08,334 INFO L225 Difference]: With dead ends: 17 [2025-03-09 02:48:08,334 INFO L226 Difference]: Without dead ends: 15 [2025-03-09 02:48:08,335 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-03-09 02:48:08,335 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 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-03-09 02:48:08,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-09 02:48:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-09 02:48:08,337 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-03-09 02:48:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-09 02:48:08,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 5 [2025-03-09 02:48:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:08,337 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-09 02:48:08,337 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-03-09 02:48:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-09 02:48:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:48:08,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:08,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:08,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:48:08,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:48:08,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1115758684, now seen corresponding path program 1 times [2025-03-09 02:48:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:08,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4923106] [2025-03-09 02:48:08,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:08,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:08,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:08,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:08,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4923106] [2025-03-09 02:48:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4923106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497916780] [2025-03-09 02:48:08,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:08,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:08,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:08,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:48:08,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:08,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:08,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:08,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:08,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:48:08,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:08,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497916780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:08,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 02:48:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892346213] [2025-03-09 02:48:08,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:48:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:08,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:48:08,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:08,785 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:08,827 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-09 02:48:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:48:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 02:48:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:08,828 INFO L225 Difference]: With dead ends: 32 [2025-03-09 02:48:08,828 INFO L226 Difference]: Without dead ends: 19 [2025-03-09 02:48:08,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:08,829 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:08,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-09 02:48:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-09 02:48:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 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-03-09 02:48:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-09 02:48:08,832 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 8 [2025-03-09 02:48:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:08,832 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-09 02:48:08,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-09 02:48:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:48:08,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:08,832 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:08,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:48:09,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:09,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:48:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1115758844, now seen corresponding path program 1 times [2025-03-09 02:48:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:09,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377018889] [2025-03-09 02:48:09,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:09,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:09,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:09,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:09,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:09,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:09,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:09,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377018889] [2025-03-09 02:48:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377018889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:09,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658036595] [2025-03-09 02:48:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:09,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:09,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:09,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:48:09,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:09,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:09,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:09,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:48:09,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:09,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658036595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:09,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:09,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 02:48:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000910154] [2025-03-09 02:48:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:09,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:48:09,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:09,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:48:09,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:09,419 INFO L87 Difference]: Start difference. First operand 19 states and 21 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-03-09 02:48:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:09,451 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-09 02:48:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:09,451 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-03-09 02:48:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:09,451 INFO L225 Difference]: With dead ends: 19 [2025-03-09 02:48:09,451 INFO L226 Difference]: Without dead ends: 18 [2025-03-09 02:48:09,451 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-03-09 02:48:09,452 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 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-03-09 02:48:09,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-09 02:48:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-09 02:48:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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-03-09 02:48:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-03-09 02:48:09,454 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2025-03-09 02:48:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:09,454 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-03-09 02:48:09,454 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-03-09 02:48:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-03-09 02:48:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:48:09,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:09,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-03-09 02:48:09,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:09,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 02:48:09,657 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-03-09 02:48:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash -351321154, now seen corresponding path program 1 times [2025-03-09 02:48:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:09,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131268719] [2025-03-09 02:48:09,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:09,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:48:09,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:48:09,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:09,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:48:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131268719] [2025-03-09 02:48:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131268719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:09,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:09,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:09,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748339308] [2025-03-09 02:48:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:09,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:09,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:09,767 INFO L87 Difference]: Start difference. First operand 18 states and 19 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-03-09 02:48:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:09,781 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-09 02:48:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:09,781 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 12 [2025-03-09 02:48:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:09,782 INFO L225 Difference]: With dead ends: 18 [2025-03-09 02:48:09,782 INFO L226 Difference]: Without dead ends: 17 [2025-03-09 02:48:09,782 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-03-09 02:48:09,782 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-03-09 02:48:09,782 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-03-09 02:48:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-09 02:48:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-09 02:48:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-03-09 02:48:09,784 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2025-03-09 02:48:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:09,784 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-09 02:48:09,784 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-03-09 02:48:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-03-09 02:48:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:48:09,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:09,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-03-09 02:48:09,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:48:09,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:48:09,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1682791644, now seen corresponding path program 2 times [2025-03-09 02:48:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:09,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35448906] [2025-03-09 02:48:09,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:09,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 02:48:09,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 14 statements. [2025-03-09 02:48:09,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:48:09,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:48:09,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:09,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35448906] [2025-03-09 02:48:09,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35448906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:09,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:09,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:09,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639020519] [2025-03-09 02:48:09,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:09,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:09,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:09,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:09,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:09,868 INFO L87 Difference]: Start difference. First operand 17 states and 18 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-03-09 02:48:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:09,904 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-09 02:48:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:09,904 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 14 [2025-03-09 02:48:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:09,904 INFO L225 Difference]: With dead ends: 32 [2025-03-09 02:48:09,904 INFO L226 Difference]: Without dead ends: 30 [2025-03-09 02:48:09,905 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-03-09 02:48:09,905 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:09,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-09 02:48:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-09 02:48:09,908 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-03-09 02:48:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-09 02:48:09,908 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 14 [2025-03-09 02:48:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:09,909 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-09 02:48:09,909 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-03-09 02:48:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-09 02:48:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:48:09,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:09,909 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:48:09,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:48:09,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:48:09,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1716609824, now seen corresponding path program 1 times [2025-03-09 02:48:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:09,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630893173] [2025-03-09 02:48:09,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:09,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:48:09,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:48:09,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:09,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:48:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630893173] [2025-03-09 02:48:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630893173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476623211] [2025-03-09 02:48:10,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:10,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:10,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:10,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:48:10,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:48:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:48:10,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:10,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:10,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:48:10,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:48:10,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476623211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:10,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:10,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 02:48:10,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75698195] [2025-03-09 02:48:10,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:10,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:48:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:10,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:48:10,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:10,465 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03-09 02:48:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:10,534 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-09 02:48:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:10,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03-09 02:48:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:10,535 INFO L225 Difference]: With dead ends: 30 [2025-03-09 02:48:10,535 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 02:48:10,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 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-03-09 02:48:10,537 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:10,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 02:48:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-09 02:48:10,542 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-03-09 02:48:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-03-09 02:48:10,542 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2025-03-09 02:48:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:10,542 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-03-09 02:48:10,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03-09 02:48:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-03-09 02:48:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:48:10,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:10,544 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 02:48:10,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:10,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:48:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1675296863, now seen corresponding path program 1 times [2025-03-09 02:48:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156067577] [2025-03-09 02:48:10,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:10,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:48:10,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:48:10,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:10,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:48:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156067577] [2025-03-09 02:48:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156067577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:10,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379233395] [2025-03-09 02:48:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:10,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:10,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:10,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:10,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:10,861 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-03-09 02:48:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:10,882 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-09 02:48:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:10,883 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-03-09 02:48:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:10,883 INFO L225 Difference]: With dead ends: 29 [2025-03-09 02:48:10,883 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:48:10,884 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-03-09 02:48:10,884 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-03-09 02:48:10,884 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-03-09 02:48:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:48:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:48:10,885 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-03-09 02:48:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:48:10,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-03-09 02:48:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:48:10,885 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-03-09 02:48:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:48:10,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:48:10,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 02:48:10,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 02:48:10,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 02:48:10,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 02:48:10,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 02:48:10,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 02:48:10,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 02:48:10,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 02:48:10,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:48:10,894 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:10,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:48:10,990 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:48:10,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:48:10 BoogieIcfgContainer [2025-03-09 02:48:10,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:48:11,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:48:11,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:48:11,000 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:48:11,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:07" (3/4) ... [2025-03-09 02:48:11,002 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:48:11,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-03-09 02:48:11,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-09 02:48:11,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-03-09 02:48:11,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-09 02:48:11,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-03-09 02:48:11,018 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-03-09 02:48:11,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 02:48:11,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-09 02:48:11,020 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 02:48:11,020 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:48:11,105 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:48:11,105 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:48:11,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:48:11,106 INFO L158 Benchmark]: Toolchain (without parser) took 5571.13ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 102.7MB in the beginning and 188.0MB in the end (delta: -85.3MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:11,106 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:11,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.69ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 75.2MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 02:48:11,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.74ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 71.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:11,106 INFO L158 Benchmark]: Boogie Preprocessor took 84.87ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 64.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:11,106 INFO L158 Benchmark]: IcfgBuilder took 1491.29ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 76.3MB in the end (delta: -12.1MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2025-03-09 02:48:11,107 INFO L158 Benchmark]: TraceAbstraction took 3372.21ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 75.7MB in the beginning and 196.4MB in the end (delta: -120.7MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2025-03-09 02:48:11,107 INFO L158 Benchmark]: Witness Printer took 105.33ms. Allocated memory is still 327.2MB. Free memory was 196.4MB in the beginning and 188.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:11,108 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.33ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.69ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 75.2MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.74ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 71.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.87ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 64.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1491.29ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 76.3MB in the end (delta: -12.1MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3372.21ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 75.7MB in the beginning and 196.4MB in the end (delta: -120.7MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Witness Printer took 105.33ms. Allocated memory is still 327.2MB. Free memory was 196.4MB in the beginning and 188.0MB in the end (delta: 8.4MB). 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: 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: 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: 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 - 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 132 locations, 220 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 227 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=0, InterpolantAutomatonStates: 37, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 150 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1436 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 168/209 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]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 805]: Location Invariant Derived location invariant: (((((i == 0) && (j == 0)) || ((i == 0) && (1 <= j))) || (((1 <= i) && (i <= 2)) && (j == 0))) || (((1 <= i) && (i <= 2)) && (1 <= j))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:48:11,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE