./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/copy-2-u.c --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/array-multidimensional/copy-2-u.c -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 d9e382438d8fbe8dfce0f613a239dc56836f436a035cb511dde070c4306eb1f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:36:43,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:36:44,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:36:44,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:36:44,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:36:44,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:36:44,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:36:44,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:36:44,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:36:44,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:36:44,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:36:44,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:36:44,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:36:44,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:36:44,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:36:44,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:44,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:36:44,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:36:44,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:36:44,073 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 -> d9e382438d8fbe8dfce0f613a239dc56836f436a035cb511dde070c4306eb1f9 [2025-03-09 01:36:44,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:36:44,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:36:44,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:36:44,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:36:44,289 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:36:44,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-2-u.c [2025-03-09 01:36:45,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe69e6e1/8417523e76264abda0c3e0420a3ee27e/FLAG503f01515 [2025-03-09 01:36:45,666 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:36:45,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-2-u.c [2025-03-09 01:36:45,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe69e6e1/8417523e76264abda0c3e0420a3ee27e/FLAG503f01515 [2025-03-09 01:36:45,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe69e6e1/8417523e76264abda0c3e0420a3ee27e [2025-03-09 01:36:45,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:36:45,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:36:45,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:45,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:36:45,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:36:45,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eab72f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45, skipping insertion in model container [2025-03-09 01:36:45,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:36:45,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:45,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:36:45,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:45,883 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:36:45,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45 WrapperNode [2025-03-09 01:36:45,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:45,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:45,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:36:45,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:36:45,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,906 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-03-09 01:36:45,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:45,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:36:45,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:36:45,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:36:45,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,930 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-09 01:36:45,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:36:45,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:36:45,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:36:45,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:36:45,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (1/1) ... [2025-03-09 01:36:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:45,973 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 01:36:45,975 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 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:36:45,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:36:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:36:46,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:36:46,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:36:46,199 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-03-09 01:36:46,206 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-09 01:36:46,206 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:36:46,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:36:46,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:36:46,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:46 BoogieIcfgContainer [2025-03-09 01:36:46,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:36:46,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:36:46,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:36:46,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:36:46,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:36:45" (1/3) ... [2025-03-09 01:36:46,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e2c5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:46, skipping insertion in model container [2025-03-09 01:36:46,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:45" (2/3) ... [2025-03-09 01:36:46,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e2c5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:46, skipping insertion in model container [2025-03-09 01:36:46,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:46" (3/3) ... [2025-03-09 01:36:46,224 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-2-u.c [2025-03-09 01:36:46,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:36:46,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-2-u.c that has 1 procedures, 39 locations, 1 initial locations, 6 loop locations, and 12 error locations. [2025-03-09 01:36:46,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:36:46,289 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;@739a9424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:36:46,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 01:36:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 38 states have internal predecessors, (45), 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 01:36:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:46,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:46,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:46,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 72495339, now seen corresponding path program 1 times [2025-03-09 01:36:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744602830] [2025-03-09 01:36:46,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:46,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:46,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:36:46,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,467 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 01:36:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744602830] [2025-03-09 01:36:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744602830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:46,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:46,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335759910] [2025-03-09 01:36:46,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:46,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:46,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:46,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:46,492 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 38 states have internal predecessors, (45), 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-03-09 01:36:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:46,567 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2025-03-09 01:36:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:46,569 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-03-09 01:36:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:46,574 INFO L225 Difference]: With dead ends: 71 [2025-03-09 01:36:46,574 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:36:46,576 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 01:36:46,578 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:46,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:36:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:36:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.606060606060606) internal successors, (53), 44 states have internal predecessors, (53), 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 01:36:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-03-09 01:36:46,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 5 [2025-03-09 01:36:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:46,603 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-09 01:36:46,603 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-03-09 01:36:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-03-09 01:36:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:46,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:46,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:46,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:36:46,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:46,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash 72495366, now seen corresponding path program 1 times [2025-03-09 01:36:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:46,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664991231] [2025-03-09 01:36:46,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:46,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:46,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:36:46,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,680 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 01:36:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664991231] [2025-03-09 01:36:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664991231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597377201] [2025-03-09 01:36:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:46,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:46,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:46,683 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 4 states, 4 states have (on average 1.25) 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 01:36:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:46,738 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2025-03-09 01:36:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:46,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) 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 01:36:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:46,739 INFO L225 Difference]: With dead ends: 88 [2025-03-09 01:36:46,740 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:36:46,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:46,741 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 55 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:46,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 37 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:36:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:36:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 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 01:36:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-09 01:36:46,746 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 5 [2025-03-09 01:36:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:46,746 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-09 01:36:46,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) 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 01:36:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-09 01:36:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:36:46,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:46,747 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:46,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:36:46,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:46,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -659897669, now seen corresponding path program 1 times [2025-03-09 01:36:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486132030] [2025-03-09 01:36:46,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:46,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:46,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:46,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,821 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 01:36:46,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:46,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486132030] [2025-03-09 01:36:46,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486132030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:46,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195421032] [2025-03-09 01:36:46,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:46,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:46,828 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 01:36:46,829 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 01:36:46,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:46,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:46,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:46,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:46,905 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 01:36:46,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:36:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195421032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:46,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:36:46,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:36:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641989564] [2025-03-09 01:36:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:46,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:46,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:46,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:46,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:46,908 INFO L87 Difference]: Start difference. First operand 45 states and 50 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 01:36:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:46,972 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-03-09 01:36:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:46,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:36:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:46,973 INFO L225 Difference]: With dead ends: 45 [2025-03-09 01:36:46,973 INFO L226 Difference]: Without dead ends: 42 [2025-03-09 01:36:46,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:46,974 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:46,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 57 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-09 01:36:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-09 01:36:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 41 states have internal predecessors, (47), 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 01:36:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-09 01:36:46,978 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 8 [2025-03-09 01:36:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:46,978 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-09 01:36:46,978 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 01:36:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-09 01:36:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:36:46,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:46,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:46,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:47,179 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 01:36:47,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:47,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash -659897642, now seen corresponding path program 1 times [2025-03-09 01:36:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012034397] [2025-03-09 01:36:47,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:47,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:47,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:47,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:47,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:36:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012034397] [2025-03-09 01:36:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012034397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008948598] [2025-03-09 01:36:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:47,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:47,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:47,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:47,235 INFO L87 Difference]: Start difference. First operand 42 states and 47 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-03-09 01:36:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:47,278 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-03-09 01:36:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:47,278 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-03-09 01:36:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:47,279 INFO L225 Difference]: With dead ends: 82 [2025-03-09 01:36:47,279 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 01:36:47,279 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 01:36:47,280 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:47,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 01:36:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-03-09 01:36:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.34375) internal successors, (86), 72 states have internal predecessors, (86), 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 01:36:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-03-09 01:36:47,286 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 8 [2025-03-09 01:36:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:47,286 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-03-09 01:36:47,287 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-03-09 01:36:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-03-09 01:36:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:36:47,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:47,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:47,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:36:47,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:47,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1018008749, now seen corresponding path program 1 times [2025-03-09 01:36:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542656270] [2025-03-09 01:36:47,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:47,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:47,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:47,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:47,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542656270] [2025-03-09 01:36:47,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542656270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445921821] [2025-03-09 01:36:47,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:47,356 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 01:36:47,366 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 01:36:47,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:47,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:47,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:47,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:47,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:47,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445921821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:47,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:47,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:36:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026631982] [2025-03-09 01:36:47,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:47,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:36:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:47,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:36:47,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:36:47,468 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:47,571 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2025-03-09 01:36:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:36:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:36:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:47,575 INFO L225 Difference]: With dead ends: 142 [2025-03-09 01:36:47,575 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 01:36:47,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:36:47,576 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:47,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 82 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 01:36:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-09 01:36:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 138 states have internal predecessors, (170), 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 01:36:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2025-03-09 01:36:47,595 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 9 [2025-03-09 01:36:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:47,596 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2025-03-09 01:36:47,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2025-03-09 01:36:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:36:47,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:47,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:47,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:36:47,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:47,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:47,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1518144387, now seen corresponding path program 1 times [2025-03-09 01:36:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:47,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792277911] [2025-03-09 01:36:47,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:47,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:47,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:47,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:47,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:47,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792277911] [2025-03-09 01:36:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792277911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256687106] [2025-03-09 01:36:47,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:47,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:47,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:47,865 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 01:36:47,867 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 01:36:47,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:47,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:47,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:47,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:36:47,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:47,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256687106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:47,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-09 01:36:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45920912] [2025-03-09 01:36:47,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:36:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:47,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:36:47,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:36:47,985 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 01:36:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:48,283 INFO L93 Difference]: Finished difference Result 260 states and 316 transitions. [2025-03-09 01:36:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:36:48,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:36:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:48,285 INFO L225 Difference]: With dead ends: 260 [2025-03-09 01:36:48,285 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 01:36:48,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:36:48,286 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 260 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:48,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 29 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:36:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 01:36:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-03-09 01:36:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 135 states have internal predecessors, (147), 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 01:36:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2025-03-09 01:36:48,295 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 15 [2025-03-09 01:36:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:48,295 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2025-03-09 01:36:48,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 01:36:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2025-03-09 01:36:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:36:48,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:48,295 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-09 01:36:48,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:36:48,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:48,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -13102979, now seen corresponding path program 2 times [2025-03-09 01:36:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281438648] [2025-03-09 01:36:48,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:48,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:36:48,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:36:48,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:48,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281438648] [2025-03-09 01:36:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281438648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101795539] [2025-03-09 01:36:48,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:48,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:48,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:36:48,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:36:48,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:36:48,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:48,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:48,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:48,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:48,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101795539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:48,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:48,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:36:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633774495] [2025-03-09 01:36:48,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:48,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:36:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:48,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:36:48,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:36:48,637 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 01:36:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:48,696 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-03-09 01:36:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:36:48,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 18 [2025-03-09 01:36:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:48,697 INFO L225 Difference]: With dead ends: 136 [2025-03-09 01:36:48,697 INFO L226 Difference]: Without dead ends: 133 [2025-03-09 01:36:48,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:36:48,698 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:48,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-09 01:36:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2025-03-09 01:36:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 116 states have internal predecessors, (125), 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 01:36:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2025-03-09 01:36:48,713 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 18 [2025-03-09 01:36:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:48,713 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2025-03-09 01:36:48,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 01:36:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2025-03-09 01:36:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:36:48,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:48,718 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:36:48,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:36:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:48,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:48,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1771439099, now seen corresponding path program 1 times [2025-03-09 01:36:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335373676] [2025-03-09 01:36:48,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:48,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:36:48,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:36:48,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:48,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 01:36:49,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335373676] [2025-03-09 01:36:49,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335373676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882580062] [2025-03-09 01:36:49,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:49,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:49,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:49,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:36:49,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:36:49,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:36:49,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:49,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:49,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:36:49,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:36:49,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:36:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882580062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:49,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-03-09 01:36:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795271540] [2025-03-09 01:36:49,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:49,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:36:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:36:49,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:36:49,245 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 01:36:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:49,885 INFO L93 Difference]: Finished difference Result 472 states and 549 transitions. [2025-03-09 01:36:49,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:36:49,885 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 34 [2025-03-09 01:36:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:49,887 INFO L225 Difference]: With dead ends: 472 [2025-03-09 01:36:49,887 INFO L226 Difference]: Without dead ends: 371 [2025-03-09 01:36:49,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:36:49,888 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1092 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:49,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 44 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:36:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-09 01:36:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-09 01:36:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 368 states have (on average 1.0380434782608696) internal successors, (382), 370 states have internal predecessors, (382), 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 01:36:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 382 transitions. [2025-03-09 01:36:49,916 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 382 transitions. Word has length 34 [2025-03-09 01:36:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:49,916 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 382 transitions. [2025-03-09 01:36:49,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 01:36:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 382 transitions. [2025-03-09 01:36:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 01:36:49,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:49,918 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 01:36:49,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:50,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:50,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:50,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1081873288, now seen corresponding path program 2 times [2025-03-09 01:36:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362447067] [2025-03-09 01:36:50,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:50,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 01:36:50,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-03-09 01:36:50,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:50,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362447067] [2025-03-09 01:36:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362447067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591270154] [2025-03-09 01:36:50,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:50,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:50,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:50,158 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:50,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:36:50,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 01:36:50,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-03-09 01:36:50,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:50,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:50,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:50,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:50,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591270154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:50,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:36:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021762992] [2025-03-09 01:36:50,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:50,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:36:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:50,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:36:50,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:36:50,455 INFO L87 Difference]: Start difference. First operand 371 states and 382 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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 01:36:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:50,497 INFO L93 Difference]: Finished difference Result 371 states and 382 transitions. [2025-03-09 01:36:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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) Word has length 104 [2025-03-09 01:36:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:50,500 INFO L225 Difference]: With dead ends: 371 [2025-03-09 01:36:50,500 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:36:50,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:36:50,502 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:50,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 13 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:36:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:36:50,504 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 01:36:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:36:50,504 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2025-03-09 01:36:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:50,504 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:36:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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 01:36:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:36:50,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-09 01:36:50,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-09 01:36:50,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-09 01:36:50,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-09 01:36:50,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-09 01:36:50,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:36:50,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:50,711 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:50,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:36:51,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:36:51,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:36:51 BoogieIcfgContainer [2025-03-09 01:36:51,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:36:51,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:36:51,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:36:51,500 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:36:51,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:46" (3/4) ... [2025-03-09 01:36:51,503 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:36:51,509 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-09 01:36:51,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:36:51,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:36:51,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:36:51,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:36:51,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:36:51,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:36:51,582 INFO L158 Benchmark]: Toolchain (without parser) took 5871.38ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 123.3MB in the beginning and 303.0MB in the end (delta: -179.6MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-03-09 01:36:51,583 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:51,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.09ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:51,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.87ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 111.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:51,584 INFO L158 Benchmark]: Boogie Preprocessor took 37.27ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 110.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:51,584 INFO L158 Benchmark]: IcfgBuilder took 270.62ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 95.4MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:51,584 INFO L158 Benchmark]: TraceAbstraction took 5281.89ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 95.4MB in the beginning and 309.6MB in the end (delta: -214.2MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2025-03-09 01:36:51,585 INFO L158 Benchmark]: Witness Printer took 81.75ms. Allocated memory is still 385.9MB. Free memory was 309.6MB in the beginning and 303.0MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:51,586 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.14ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.09ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.87ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 111.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.27ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 110.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 270.62ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 95.4MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5281.89ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 95.4MB in the beginning and 309.6MB in the end (delta: -214.2MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Witness Printer took 81.75ms. Allocated memory is still 385.9MB. Free memory was 309.6MB in the beginning and 303.0MB in the end (delta: 6.6MB). There was no memory consumed. 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: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: 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, 39 locations, 45 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 30, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1602 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1602 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 158 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 394 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 554 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 4 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 2580/4667 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 12 specifications checked. All of them hold - InvariantResult [Line: 41]: Location Invariant Derived location invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: ((((((((1 <= i) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1000)) || ((((i == 0) && (1 <= j)) && (j <= 2147483646)) && (n == 1000))) || (((i == 0) && (j == 0)) && (n == 1000))) || ((((1 <= i) && (i <= 999)) && (j == 0)) && (n == 1000))) - InvariantResult [Line: 55]: Location Invariant Derived location invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((i == 0) && (n == 1000)) || (((1 <= i) && (i <= 2147483646)) && (n == 1000))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:36:51,606 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