./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 383b4a741115f7461f3219e8b6813a438e778f299f3d0f3c72277e19fd6c8f24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:09:03,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:09:03,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 09:09:03,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:09:03,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:09:03,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:09:03,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:09:03,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:09:03,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:09:03,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:09:03,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:09:03,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:09:03,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:09:03,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:09:03,683 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:09:03,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:09:03,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:09:03,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:09:03,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:09:03,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:09:03,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:09:03,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:09:03,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:09:03,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:09:03,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:09:03,688 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 383b4a741115f7461f3219e8b6813a438e778f299f3d0f3c72277e19fd6c8f24 [2025-02-08 09:09:03,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:09:03,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:09:03,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:09:03,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:09:03,984 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:09:03,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2025-02-08 09:09:05,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66af582b4/06e9775e640749d29462c89bbf347d00/FLAG06e9635f0 [2025-02-08 09:09:05,626 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:09:05,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2025-02-08 09:09:05,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66af582b4/06e9775e640749d29462c89bbf347d00/FLAG06e9635f0 [2025-02-08 09:09:05,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66af582b4/06e9775e640749d29462c89bbf347d00 [2025-02-08 09:09:05,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:09:05,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:09:05,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:09:05,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:09:05,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:09:05,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:09:05" (1/1) ... [2025-02-08 09:09:05,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:05, skipping insertion in model container [2025-02-08 09:09:05,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:09:05" (1/1) ... [2025-02-08 09:09:05,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:09:05,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:09:05,955 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:09:06,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:09:06,034 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:09:06,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06 WrapperNode [2025-02-08 09:09:06,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:09:06,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:09:06,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:09:06,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:09:06,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,070 INFO L138 Inliner]: procedures = 113, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2025-02-08 09:09:06,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:09:06,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:09:06,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:09:06,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:09:06,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,105 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-02-08 09:09:06,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:09:06,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:09:06,122 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:09:06,122 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:09:06,123 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (1/1) ... [2025-02-08 09:09:06,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:09:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:09:06,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:09:06,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:09:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 09:09:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 09:09:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 09:09:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 09:09:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 09:09:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 09:09:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:09:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:09:06,276 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:09:06,279 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:09:06,547 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: assume !true; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-1: assume cstrstr_~sc~0#1 != cstrstr_~c~0#1; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-1: assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1); [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: assume !true; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-1: assume 0 != cstrncmp_#t~pre12#1 % 18446744073709551616;havoc cstrncmp_#t~pre12#1; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-1: assume !(0 != cstrncmp_#t~pre12#1 % 18446744073709551616);havoc cstrncmp_#t~pre12#1; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L581: cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset - 1;havoc cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: assume 0 == cstrstr_~sc~0#1;havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;cstrstr_#res#1.base, cstrstr_#res#1.offset := 0, 0; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1; [2025-02-08 09:09:06,552 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_#t~ret24#1.base, main_#t~ret24#1.offset;call ULTIMATE.dealloc(main_#t~malloc22#1.base, main_#t~malloc22#1.offset);havoc main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call ULTIMATE.dealloc(main_#t~malloc23#1.base, main_#t~malloc23#1.offset);havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset; [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#1(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1); [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1); [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L566-1: cstrncmp_#res#1 := 0; [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-1: assume (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296) <= 2147483647;cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1; [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-1: assume !((if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296) <= 2147483647); [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-2: assume (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296) >= -2147483648; [2025-02-08 09:09:06,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L562-2: assume !((if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296) >= -2147483648); [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: assume 0 == cstrncmp_~n#1 % 18446744073709551616;cstrncmp_#res#1 := 0; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: assume !(0 == cstrncmp_~n#1 % 18446744073709551616); [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: assume true; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: assume !true; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-1: assume 0 != cstrstr_#t~ret18#1;havoc cstrstr_#t~ret18#1; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L575-1: assume !(0 != cstrstr_#t~ret18#1);havoc cstrstr_#t~ret18#1; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: assume 0 == cstrncmp_#t~mem11#1;havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L580: cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true;assume -2147483648 <= cstrstr_#t~ret18#1 && cstrstr_#t~ret18#1 <= 2147483647; [2025-02-08 09:09:06,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L580-1: assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; [2025-02-08 09:09:06,568 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-08 09:09:06,570 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:09:06,579 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:09:06,580 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:09:06,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:09:06 BoogieIcfgContainer [2025-02-08 09:09:06,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:09:06,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:09:06,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:09:06,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:09:06,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:09:05" (1/3) ... [2025-02-08 09:09:06,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b19c620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:09:06, skipping insertion in model container [2025-02-08 09:09:06,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:09:06" (2/3) ... [2025-02-08 09:09:06,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b19c620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:09:06, skipping insertion in model container [2025-02-08 09:09:06,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:09:06" (3/3) ... [2025-02-08 09:09:06,592 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca-1.i [2025-02-08 09:09:06,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:09:06,610 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrstr-alloca-1.i that has 1 procedures, 21 locations, 1 initial locations, 4 loop locations, and 6 error locations. [2025-02-08 09:09:06,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:09:06,669 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;@68198770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:09:06,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 09:09:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:09:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:09:06,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:09:06,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:09:06,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:09:06,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:09:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash 89641084, now seen corresponding path program 1 times [2025-02-08 09:09:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:09:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124483580] [2025-02-08 09:09:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:09:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:09:06,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:09:06,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:09:06,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:09:06,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:09:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:09:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:09:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124483580] [2025-02-08 09:09:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124483580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:09:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:09:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:09:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180060895] [2025-02-08 09:09:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:09:06,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:09:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:09:06,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:09:06,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:09:06,931 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) 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-02-08 09:09:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:09:06,962 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-02-08 09:09:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:09:06,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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-02-08 09:09:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:09:06,975 INFO L225 Difference]: With dead ends: 23 [2025-02-08 09:09:06,975 INFO L226 Difference]: Without dead ends: 11 [2025-02-08 09:09:06,977 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-02-08 09:09:06,981 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:09:06,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:09:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-08 09:09:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 09:09:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 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-02-08 09:09:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-02-08 09:09:07,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2025-02-08 09:09:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:09:07,011 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-08 09:09:07,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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-02-08 09:09:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2025-02-08 09:09:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:09:07,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:09:07,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:09:07,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:09:07,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:09:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:09:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1516093667, now seen corresponding path program 1 times [2025-02-08 09:09:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:09:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-02-08 09:09:07,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:09:07,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:09:07,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:09:07,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:09:07,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:09:07,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:09:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:09:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:09:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-02-08 09:09:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890222906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:09:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:09:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:09:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274432791] [2025-02-08 09:09:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:09:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:09:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:09:07,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:09:07,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:09:07,111 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-08 09:09:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:09:07,127 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2025-02-08 09:09:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:09:07,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 09:09:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:09:07,128 INFO L225 Difference]: With dead ends: 16 [2025-02-08 09:09:07,128 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 09:09:07,129 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-02-08 09:09:07,129 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:09:07,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:09:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 09:09:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 09:09:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 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-02-08 09:09:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-02-08 09:09:07,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 6 [2025-02-08 09:09:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:09:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-08 09:09:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-08 09:09:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-02-08 09:09:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:09:07,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:09:07,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:09:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:09:07,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:09:07,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:09:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1515170146, now seen corresponding path program 1 times [2025-02-08 09:09:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:09:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387495550] [2025-02-08 09:09:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:09:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:09:07,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:09:07,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:09:07,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:09:07,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:09:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:09:07,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:09:07,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387495550] [2025-02-08 09:09:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387495550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:09:07,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:09:07,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:09:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936969354] [2025-02-08 09:09:07,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:09:07,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:09:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:09:07,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:09:07,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:09:07,188 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 09:09:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:09:07,201 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-08 09:09:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:09:07,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-08 09:09:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:09:07,202 INFO L225 Difference]: With dead ends: 15 [2025-02-08 09:09:07,202 INFO L226 Difference]: Without dead ends: 14 [2025-02-08 09:09:07,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-08 09:09:07,204 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:09:07,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:09:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-08 09:09:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2025-02-08 09:09:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-02-08 09:09:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-08 09:09:07,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2025-02-08 09:09:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:09:07,209 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-08 09:09:07,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-08 09:09:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2025-02-08 09:09:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 09:09:07,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:09:07,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:09:07,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:09:07,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:09:07,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:09:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash 245736602, now seen corresponding path program 1 times [2025-02-08 09:09:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:09:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387199807] [2025-02-08 09:09:07,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:09:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:09:07,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 09:09:07,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 09:09:07,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:09:07,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:09:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:09:07,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:09:07,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387199807] [2025-02-08 09:09:07,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387199807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:09:07,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:09:07,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:09:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262981888] [2025-02-08 09:09:07,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:09:07,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:09:07,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:09:07,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:09:07,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:09:07,316 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-02-08 09:09:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:09:07,331 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2025-02-08 09:09:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:09:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-02-08 09:09:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:09:07,332 INFO L225 Difference]: With dead ends: 10 [2025-02-08 09:09:07,332 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 09:09:07,332 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-02-08 09:09:07,333 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:09:07,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:09:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 09:09:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-08 09:09:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-02-08 09:09:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-02-08 09:09:07,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2025-02-08 09:09:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:09:07,339 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 09:09:07,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-02-08 09:09:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-02-08 09:09:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:09:07,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:09:07,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:09:07,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:09:07,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:09:07,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:09:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash -972099909, now seen corresponding path program 1 times [2025-02-08 09:09:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:09:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914146485] [2025-02-08 09:09:07,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:09:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:09:07,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:09:07,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:09:07,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:09:07,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:09:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:09:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:09:07,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914146485] [2025-02-08 09:09:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914146485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:09:07,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:09:07,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:09:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456170226] [2025-02-08 09:09:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:09:07,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:09:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:09:07,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:09:07,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:09:07,389 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:09:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:09:07,398 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-08 09:09:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:09:07,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 09:09:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:09:07,399 INFO L225 Difference]: With dead ends: 15 [2025-02-08 09:09:07,399 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 09:09:07,399 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-02-08 09:09:07,400 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:09:07,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:09:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 09:09:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-08 09:09:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-02-08 09:09:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-08 09:09:07,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2025-02-08 09:09:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:09:07,402 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-08 09:09:07,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:09:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-08 09:09:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:09:07,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:09:07,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:09:07,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:09:07,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:09:07,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:09:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash -943470758, now seen corresponding path program 1 times [2025-02-08 09:09:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:09:07,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769267719] [2025-02-08 09:09:07,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:09:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:09:07,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:09:07,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:09:07,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:09:07,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:09:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:09:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:09:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769267719] [2025-02-08 09:09:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769267719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:09:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:09:07,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:09:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786358373] [2025-02-08 09:09:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:09:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:09:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:09:07,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:09:07,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:09:07,463 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 09:09:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:09:07,469 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2025-02-08 09:09:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:09:07,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 09:09:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:09:07,469 INFO L225 Difference]: With dead ends: 9 [2025-02-08 09:09:07,470 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:09:07,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-08 09:09:07,470 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:09:07,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:09:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:09:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:09:07,472 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-02-08 09:09:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:09:07,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2025-02-08 09:09:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:09:07,472 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:09:07,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-02-08 09:09:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:09:07,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:09:07,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 09:09:07,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 09:09:07,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 09:09:07,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 09:09:07,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 09:09:07,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 09:09:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:09:07,481 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 09:09:07,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:09:07,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:09:07,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:09:07 BoogieIcfgContainer [2025-02-08 09:09:07,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:09:07,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:09:07,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:09:07,509 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:09:07,510 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:09:06" (3/4) ... [2025-02-08 09:09:07,511 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:09:07,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 09:09:07,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:09:07,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 09:09:07,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:09:07,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:09:07,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:09:07,590 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:09:07,591 INFO L158 Benchmark]: Toolchain (without parser) took 1924.81ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 84.5MB in the end (delta: 18.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2025-02-08 09:09:07,592 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:09:07,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.97ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 86.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:09:07,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.74ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 85.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:09:07,593 INFO L158 Benchmark]: Boogie Preprocessor took 42.37ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:09:07,593 INFO L158 Benchmark]: IcfgBuilder took 459.49ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 66.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:09:07,593 INFO L158 Benchmark]: TraceAbstraction took 925.05ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 90.6MB in the end (delta: -25.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:09:07,594 INFO L158 Benchmark]: Witness Printer took 81.59ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 84.5MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:09:07,595 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.37ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.97ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 86.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.74ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 85.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.37ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.0MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 459.49ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 66.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 925.05ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 90.6MB in the end (delta: -25.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 81.59ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 84.5MB in the end (delta: 6.1MB). 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: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 596]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 596]: 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 1 procedures, 21 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 53 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 18, 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 09:09:07,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE