./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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-3-n-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 caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:39:40,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:39:40,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:39:40,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:39:40,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:39:40,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:39:40,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:39:40,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:39:40,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:39:40,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:39:40,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:39:40,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:39:40,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:39:40,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:39:40,222 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:39:40,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:39:40,223 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:39:40,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:39:40,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:39:40,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:39:40,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:39:40,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:39:40,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:39:40,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:39:40,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:40,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:39:40,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:39:40,225 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 -> caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 [2025-03-17 14:39:40,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:39:40,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:39:40,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:39:40,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:39:40,450 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:39:40,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2025-03-17 14:39:41,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85be0cac5/5a7f7c8977774e968ad4eab9561cee4e/FLAGd0b8dcef9 [2025-03-17 14:39:41,806 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:39:41,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2025-03-17 14:39:41,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85be0cac5/5a7f7c8977774e968ad4eab9561cee4e/FLAGd0b8dcef9 [2025-03-17 14:39:42,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85be0cac5/5a7f7c8977774e968ad4eab9561cee4e [2025-03-17 14:39:42,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:39:42,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:39:42,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:42,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:39:42,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:39:42,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390e58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42, skipping insertion in model container [2025-03-17 14:39:42,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:39:42,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:42,253 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:39:42,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:39:42,275 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:39:42,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42 WrapperNode [2025-03-17 14:39:42,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:39:42,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:42,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:39:42,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:39:42,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,294 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2025-03-17 14:39:42,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:39:42,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:39:42,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:39:42,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:39:42,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,309 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-17 14:39:42,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:39:42,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:39:42,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:39:42,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:39:42,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (1/1) ... [2025-03-17 14:39:42,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:39:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:42,342 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-17 14:39:42,345 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-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:39:42,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:39:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:39:42,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:39:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:39:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:39:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:39:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:39:42,407 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:39:42,408 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:39:42,596 INFO L1322 $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-17 14:39:42,608 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-17 14:39:42,609 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:39:42,615 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:39:42,615 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:39:42,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:42 BoogieIcfgContainer [2025-03-17 14:39:42,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:39:42,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:39:42,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:39:42,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:39:42,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:39:42" (1/3) ... [2025-03-17 14:39:42,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650d30a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:42, skipping insertion in model container [2025-03-17 14:39:42,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:39:42" (2/3) ... [2025-03-17 14:39:42,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650d30a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:39:42, skipping insertion in model container [2025-03-17 14:39:42,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:42" (3/3) ... [2025-03-17 14:39:42,622 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-3-n-u.c [2025-03-17 14:39:42,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:39:42,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-3-n-u.c that has 1 procedures, 51 locations, 1 initial locations, 9 loop locations, and 18 error locations. [2025-03-17 14:39:42,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:39:42,683 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;@44f454c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:39:42,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:39:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.875) internal successors, (60), 50 states have internal predecessors, (60), 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-17 14:39:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:39:42,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:42,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:39:42,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:42,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2769524, now seen corresponding path program 1 times [2025-03-17 14:39:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640355441] [2025-03-17 14:39:42,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:42,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:39:42,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:39:42,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:42,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:42,844 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-17 14:39:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640355441] [2025-03-17 14:39:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640355441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:42,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:42,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673270659] [2025-03-17 14:39:42,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:42,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:42,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:42,867 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.875) internal successors, (60), 50 states have internal predecessors, (60), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 14:39:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:42,974 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2025-03-17 14:39:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-17 14:39:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:42,980 INFO L225 Difference]: With dead ends: 127 [2025-03-17 14:39:42,980 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 14:39:42,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 14:39:42,984 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:42,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 78 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 14:39:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-17 14:39:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.7) internal successors, (85), 67 states have internal predecessors, (85), 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-17 14:39:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-17 14:39:43,013 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 4 [2025-03-17 14:39:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:43,013 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-17 14:39:43,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 14:39:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-17 14:39:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:39:43,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:43,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:39:43,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:39:43,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:43,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash 85854616, now seen corresponding path program 1 times [2025-03-17 14:39:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458181025] [2025-03-17 14:39:43,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:39:43,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:39:43,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:43,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:43,074 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-17 14:39:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458181025] [2025-03-17 14:39:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458181025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:43,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:39:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231500304] [2025-03-17 14:39:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:43,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:43,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:43,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:39:43,076 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. 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-17 14:39:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:43,126 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2025-03-17 14:39:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:43,127 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-17 14:39:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:43,127 INFO L225 Difference]: With dead ends: 96 [2025-03-17 14:39:43,127 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 14:39:43,128 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-17 14:39:43,128 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:43,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 14:39:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 14:39:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 89 states have internal predecessors, (113), 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-17 14:39:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2025-03-17 14:39:43,134 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 5 [2025-03-17 14:39:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2025-03-17 14:39:43,135 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-17 14:39:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2025-03-17 14:39:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:39:43,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:43,135 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:39:43,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:43,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2105622181, now seen corresponding path program 1 times [2025-03-17 14:39:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:43,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136847491] [2025-03-17 14:39:43,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:43,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:39:43,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:39:43,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:43,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:43,213 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-17 14:39:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136847491] [2025-03-17 14:39:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136847491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866579234] [2025-03-17 14:39:43,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:43,216 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-17 14:39:43,225 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-17 14:39:43,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:39:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:39:43,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:43,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:43,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:43,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:43,292 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-17 14:39:43,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:39:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866579234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:43,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:39:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 14:39:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321499910] [2025-03-17 14:39:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:43,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:43,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:43,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:39:43,294 INFO L87 Difference]: Start difference. First operand 90 states and 113 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-17 14:39:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:43,341 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2025-03-17 14:39:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:43,341 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-17 14:39:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:43,342 INFO L225 Difference]: With dead ends: 90 [2025-03-17 14:39:43,342 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 14:39:43,342 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-17 14:39:43,343 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:43,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 14:39:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 14:39:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 86 states have internal predecessors, (107), 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-17 14:39:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2025-03-17 14:39:43,359 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 8 [2025-03-17 14:39:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:43,359 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2025-03-17 14:39:43,359 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-17 14:39:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2025-03-17 14:39:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:39:43,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:43,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:43,367 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-17 14:39:43,560 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-17 14:39:43,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:43,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2104821583, now seen corresponding path program 1 times [2025-03-17 14:39:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:43,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092816844] [2025-03-17 14:39:43,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:43,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:39:43,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:39:43,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:43,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:39:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092816844] [2025-03-17 14:39:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092816844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:43,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:39:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022403812] [2025-03-17 14:39:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:39:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:43,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:39:43,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:39:43,648 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 4 states, 4 states have (on average 2.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-17 14:39:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:43,695 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2025-03-17 14:39:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.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-17 14:39:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:43,696 INFO L225 Difference]: With dead ends: 173 [2025-03-17 14:39:43,696 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 14:39:43,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 14:39:43,698 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:43,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 75 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 14:39:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 14:39:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 86 states have internal predecessors, (101), 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-17 14:39:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2025-03-17 14:39:43,703 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 8 [2025-03-17 14:39:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:43,704 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2025-03-17 14:39:43,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.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-17 14:39:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2025-03-17 14:39:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:39:43,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:43,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:39:43,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:39:43,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -849778150, now seen corresponding path program 1 times [2025-03-17 14:39:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690113267] [2025-03-17 14:39:43,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:43,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:39:43,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:39:43,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:43,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:43,771 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-17 14:39:43,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:43,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690113267] [2025-03-17 14:39:43,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690113267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:43,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768496256] [2025-03-17 14:39:43,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:43,773 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-17 14:39:43,775 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-17 14:39:43,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:39:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:39:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:43,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:43,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:43,825 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-17 14:39:43,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:43,844 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-17 14:39:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768496256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:43,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:39:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129839830] [2025-03-17 14:39:43,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:43,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:39:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:43,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:39:43,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:39:43,846 INFO L87 Difference]: Start difference. First operand 87 states and 101 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-17 14:39:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:43,926 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2025-03-17 14:39:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:39:43,927 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-17 14:39:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:43,928 INFO L225 Difference]: With dead ends: 156 [2025-03-17 14:39:43,929 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 14:39:43,929 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-17 14:39:43,930 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:43,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:39:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 14:39:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-17 14:39:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 152 states have internal predecessors, (185), 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-17 14:39:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 185 transitions. [2025-03-17 14:39:43,948 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 185 transitions. Word has length 9 [2025-03-17 14:39:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:43,949 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 185 transitions. [2025-03-17 14:39:43,949 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-17 14:39:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 185 transitions. [2025-03-17 14:39:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:39:43,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:43,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:43,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:44,149 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-17 14:39:44,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:44,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash -592214514, now seen corresponding path program 1 times [2025-03-17 14:39:44,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:44,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428783127] [2025-03-17 14:39:44,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:44,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:44,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:39:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:39:44,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:44,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:39:44,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:44,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428783127] [2025-03-17 14:39:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428783127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:39:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:39:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:39:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568553680] [2025-03-17 14:39:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:39:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:39:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:44,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:39:44,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:39:44,178 INFO L87 Difference]: Start difference. First operand 153 states and 185 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:44,223 INFO L93 Difference]: Finished difference Result 305 states and 369 transitions. [2025-03-17 14:39:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:39:44,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:39:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:44,224 INFO L225 Difference]: With dead ends: 305 [2025-03-17 14:39:44,224 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 14:39:44,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:39:44,225 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 71 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-17 14:39:44,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 71 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 14:39:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 290. [2025-03-17 14:39:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 275 states have (on average 1.32) internal successors, (363), 289 states have internal predecessors, (363), 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-17 14:39:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 363 transitions. [2025-03-17 14:39:44,251 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 363 transitions. Word has length 11 [2025-03-17 14:39:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:44,251 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 363 transitions. [2025-03-17 14:39:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 363 transitions. [2025-03-17 14:39:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:39:44,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:44,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:39:44,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:39:44,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1423398896, now seen corresponding path program 1 times [2025-03-17 14:39:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142490305] [2025-03-17 14:39:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:39:44,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:39:44,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:44,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:44,320 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-17 14:39:44,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142490305] [2025-03-17 14:39:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142490305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926343034] [2025-03-17 14:39:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:44,323 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-17 14:39:44,324 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-17 14:39:44,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:39:44,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:39:44,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:44,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:44,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:39:44,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:44,399 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-17 14:39:44,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:44,426 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-17 14:39:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926343034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:44,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2025-03-17 14:39:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616200330] [2025-03-17 14:39:44,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:44,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:39:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:44,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:39:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:39:44,428 INFO L87 Difference]: Start difference. First operand 290 states and 363 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-17 14:39:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:44,723 INFO L93 Difference]: Finished difference Result 562 states and 702 transitions. [2025-03-17 14:39:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:39:44,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-17 14:39:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:44,725 INFO L225 Difference]: With dead ends: 562 [2025-03-17 14:39:44,725 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 14:39:44,726 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-17 14:39:44,726 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 317 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:44,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 102 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:39:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 14:39:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2025-03-17 14:39:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.1672727272727272) internal successors, (321), 286 states have internal predecessors, (321), 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-17 14:39:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 321 transitions. [2025-03-17 14:39:44,743 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 321 transitions. Word has length 15 [2025-03-17 14:39:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:44,743 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 321 transitions. [2025-03-17 14:39:44,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-17 14:39:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 321 transitions. [2025-03-17 14:39:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:39:44,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:44,748 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-17 14:39:44,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:44,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:44,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1311293635, now seen corresponding path program 2 times [2025-03-17 14:39:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:44,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057653487] [2025-03-17 14:39:44,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:44,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:39:44,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 14:39:44,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:44,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:44,985 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-17 14:39:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057653487] [2025-03-17 14:39:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057653487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:44,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830768695] [2025-03-17 14:39:44,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:44,988 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-17 14:39:44,989 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-17 14:39:45,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 14:39:45,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 14:39:45,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:45,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:45,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:45,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:45,063 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-17 14:39:45,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:45,097 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-17 14:39:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830768695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:45,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:45,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:39:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701812314] [2025-03-17 14:39:45,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:45,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:39:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:45,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:39:45,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:45,099 INFO L87 Difference]: Start difference. First operand 287 states and 321 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:45,150 INFO L93 Difference]: Finished difference Result 287 states and 321 transitions. [2025-03-17 14:39:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:39:45,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:39:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:45,151 INFO L225 Difference]: With dead ends: 287 [2025-03-17 14:39:45,151 INFO L226 Difference]: Without dead ends: 284 [2025-03-17 14:39:45,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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-17 14:39:45,152 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 100 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:45,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-17 14:39:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 252. [2025-03-17 14:39:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 243 states have (on average 1.139917695473251) internal successors, (277), 251 states have internal predecessors, (277), 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-17 14:39:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2025-03-17 14:39:45,169 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 18 [2025-03-17 14:39:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:45,169 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2025-03-17 14:39:45,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2025-03-17 14:39:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 14:39:45,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:45,172 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:39:45,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:45,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:45,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1931845701, now seen corresponding path program 1 times [2025-03-17 14:39:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:45,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2412138] [2025-03-17 14:39:45,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:45,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:39:45,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:39:45,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:45,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:45,451 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-17 14:39:45,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:45,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2412138] [2025-03-17 14:39:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2412138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:45,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127498155] [2025-03-17 14:39:45,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:45,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:45,484 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-17 14:39:45,486 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-17 14:39:45,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:39:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:39:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:45,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:39:45,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:45,637 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-17 14:39:45,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:45,713 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-17 14:39:45,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127498155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:45,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:45,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 16 [2025-03-17 14:39:45,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794268580] [2025-03-17 14:39:45,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:45,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:39:45,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:45,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:39:45,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:39:45,716 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-17 14:39:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:46,335 INFO L93 Difference]: Finished difference Result 996 states and 1170 transitions. [2025-03-17 14:39:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 14:39:46,336 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-17 14:39:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:46,338 INFO L225 Difference]: With dead ends: 996 [2025-03-17 14:39:46,338 INFO L226 Difference]: Without dead ends: 760 [2025-03-17 14:39:46,340 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-17 14:39:46,341 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 781 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:46,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 160 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:39:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-17 14:39:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2025-03-17 14:39:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 751 states have (on average 1.0612516644474035) internal successors, (797), 759 states have internal predecessors, (797), 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-17 14:39:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 797 transitions. [2025-03-17 14:39:46,384 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 797 transitions. Word has length 34 [2025-03-17 14:39:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:46,385 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 797 transitions. [2025-03-17 14:39:46,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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-17 14:39:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 797 transitions. [2025-03-17 14:39:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 14:39:46,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:46,387 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:39:46,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:39:46,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:46,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:46,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2098867281, now seen corresponding path program 1 times [2025-03-17 14:39:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022517448] [2025-03-17 14:39:46,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:46,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 14:39:46,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 14:39:46,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:46,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-17 14:39:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022517448] [2025-03-17 14:39:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022517448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114639964] [2025-03-17 14:39:46,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:46,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:46,723 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-17 14:39:46,725 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-17 14:39:46,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 14:39:46,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 14:39:46,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:46,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:46,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:39:46,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 14:39:47,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-17 14:39:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114639964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:47,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:47,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 13, 13] total 27 [2025-03-17 14:39:47,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561362680] [2025-03-17 14:39:47,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:47,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:39:47,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:47,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:39:47,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:39:47,214 INFO L87 Difference]: Start difference. First operand 760 states and 797 transitions. Second operand has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 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-17 14:39:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:48,484 INFO L93 Difference]: Finished difference Result 2278 states and 2566 transitions. [2025-03-17 14:39:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 14:39:48,485 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 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 76 [2025-03-17 14:39:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:48,489 INFO L225 Difference]: With dead ends: 2278 [2025-03-17 14:39:48,489 INFO L226 Difference]: Without dead ends: 1552 [2025-03-17 14:39:48,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1549, Invalid=3853, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 14:39:48,492 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1534 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:48,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 201 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:39:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-03-17 14:39:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1549. [2025-03-17 14:39:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1543 states have (on average 1.0278677900194426) internal successors, (1586), 1548 states have internal predecessors, (1586), 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-17 14:39:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1586 transitions. [2025-03-17 14:39:48,553 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1586 transitions. Word has length 76 [2025-03-17 14:39:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:48,554 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 1586 transitions. [2025-03-17 14:39:48,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 27 states have internal predecessors, (102), 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-17 14:39:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1586 transitions. [2025-03-17 14:39:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 14:39:48,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:48,559 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 14:39:48,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:48,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:48,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1564927140, now seen corresponding path program 1 times [2025-03-17 14:39:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157456227] [2025-03-17 14:39:48,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:48,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 14:39:48,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 14:39:48,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:48,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 0 proven. 1506 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2025-03-17 14:39:48,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:48,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157456227] [2025-03-17 14:39:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157456227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:48,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589016208] [2025-03-17 14:39:48,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:39:48,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:48,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:48,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:48,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:39:49,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 14:39:49,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 14:39:49,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:39:49,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:49,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:39:49,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 14:39:49,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 14:39:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589016208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:50,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 25, 25] total 51 [2025-03-17 14:39:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512765365] [2025-03-17 14:39:50,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 14:39:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:50,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 14:39:50,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 14:39:50,081 INFO L87 Difference]: Start difference. First operand 1549 states and 1586 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 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-17 14:39:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:54,629 INFO L93 Difference]: Finished difference Result 6181 states and 6918 transitions. [2025-03-17 14:39:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-17 14:39:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 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 149 [2025-03-17 14:39:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:54,644 INFO L225 Difference]: With dead ends: 6181 [2025-03-17 14:39:54,644 INFO L226 Difference]: Without dead ends: 4702 [2025-03-17 14:39:54,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2025-03-17 14:39:54,651 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4035 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 964 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4035 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 964 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:54,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4035 Valid, 205 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [964 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 14:39:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2025-03-17 14:39:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 4696. [2025-03-17 14:39:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4690 states have (on average 1.0134328358208955) internal successors, (4753), 4695 states have internal predecessors, (4753), 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-17 14:39:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 4753 transitions. [2025-03-17 14:39:54,796 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 4753 transitions. Word has length 149 [2025-03-17 14:39:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:54,798 INFO L471 AbstractCegarLoop]: Abstraction has 4696 states and 4753 transitions. [2025-03-17 14:39:54,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 51 states have internal predecessors, (175), 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-17 14:39:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 4753 transitions. [2025-03-17 14:39:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-17 14:39:54,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:54,804 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1] [2025-03-17 14:39:54,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:39:55,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:55,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:55,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1137441320, now seen corresponding path program 2 times [2025-03-17 14:39:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659895994] [2025-03-17 14:39:55,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:55,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 428 statements into 2 equivalence classes. [2025-03-17 14:39:55,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 428 statements. [2025-03-17 14:39:55,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:55,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-17 14:39:55,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659895994] [2025-03-17 14:39:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659895994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462289843] [2025-03-17 14:39:55,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:55,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:55,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:55,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:55,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:39:55,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 428 statements into 2 equivalence classes. [2025-03-17 14:39:55,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 428 statements. [2025-03-17 14:39:55,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:55,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:55,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:55,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-17 14:39:55,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-17 14:39:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462289843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:55,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:39:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648270493] [2025-03-17 14:39:55,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:55,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:39:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:55,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:39:55,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:55,857 INFO L87 Difference]: Start difference. First operand 4696 states and 4753 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:55,957 INFO L93 Difference]: Finished difference Result 4696 states and 4753 transitions. [2025-03-17 14:39:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:39:55,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2025-03-17 14:39:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:55,970 INFO L225 Difference]: With dead ends: 4696 [2025-03-17 14:39:55,970 INFO L226 Difference]: Without dead ends: 4693 [2025-03-17 14:39:55,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 852 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-17 14:39:55,972 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:55,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 38 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4693 states. [2025-03-17 14:39:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4693 to 1594. [2025-03-17 14:39:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1591 states have (on average 1.0169704588309239) internal successors, (1618), 1593 states have internal predecessors, (1618), 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-17 14:39:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1618 transitions. [2025-03-17 14:39:56,049 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1618 transitions. Word has length 428 [2025-03-17 14:39:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:56,050 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 1618 transitions. [2025-03-17 14:39:56,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:39:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1618 transitions. [2025-03-17 14:39:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-17 14:39:56,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:39:56,055 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2025-03-17 14:39:56,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:39:56,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:39:56,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:39:56,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:39:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 831848796, now seen corresponding path program 2 times [2025-03-17 14:39:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:39:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051102386] [2025-03-17 14:39:56,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:39:56,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 439 statements into 2 equivalence classes. [2025-03-17 14:39:56,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 439 statements. [2025-03-17 14:39:56,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:56,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-17 14:39:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:39:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051102386] [2025-03-17 14:39:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051102386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:39:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351184538] [2025-03-17 14:39:56,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:39:56,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:39:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:39:56,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:39:56,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:39:56,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 439 statements into 2 equivalence classes. [2025-03-17 14:39:56,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 439 statements. [2025-03-17 14:39:56,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:39:56,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:39:56,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:39:56,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:39:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-17 14:39:56,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:39:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-17 14:39:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351184538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:39:57,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:39:57,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:39:57,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327185015] [2025-03-17 14:39:57,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:39:57,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:39:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:39:57,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:39:57,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:39:57,147 INFO L87 Difference]: Start difference. First operand 1594 states and 1618 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 14:39:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:39:57,260 INFO L93 Difference]: Finished difference Result 1594 states and 1618 transitions. [2025-03-17 14:39:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:39:57,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 439 [2025-03-17 14:39:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:39:57,262 INFO L225 Difference]: With dead ends: 1594 [2025-03-17 14:39:57,262 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:39:57,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 874 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-17 14:39:57,265 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:39:57,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:39:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:39:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:39:57,266 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-17 14:39:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:39:57,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 439 [2025-03-17 14:39:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:39:57,268 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:39:57,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-17 14:39:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:39:57,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:39:57,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-17 14:39:57,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-17 14:39:57,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-17 14:39:57,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-17 14:39:57,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-17 14:39:57,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:39:57,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:39:57,476 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:39:57,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:40:08,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:40:08,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:40:08 BoogieIcfgContainer [2025-03-17 14:40:08,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:40:08,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:40:08,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:40:08,267 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:40:08,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:39:42" (3/4) ... [2025-03-17 14:40:08,273 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:40:08,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-17 14:40:08,292 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:40:08,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:40:08,296 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:40:08,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:40:08,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:40:08,400 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:40:08,401 INFO L158 Benchmark]: Toolchain (without parser) took 26274.45ms. Allocated memory was 142.6MB in the beginning and 746.6MB in the end (delta: 604.0MB). Free memory was 106.2MB in the beginning and 353.8MB in the end (delta: -247.7MB). Peak memory consumption was 354.7MB. Max. memory is 16.1GB. [2025-03-17 14:40:08,401 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:08,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.34ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:08,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.73ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.4MB in the end (delta: 628.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:40:08,401 INFO L158 Benchmark]: Boogie Preprocessor took 21.04ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:08,401 INFO L158 Benchmark]: IcfgBuilder took 298.84ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 75.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:40:08,402 INFO L158 Benchmark]: TraceAbstraction took 25649.36ms. Allocated memory was 142.6MB in the beginning and 746.6MB in the end (delta: 604.0MB). Free memory was 74.5MB in the beginning and 360.5MB in the end (delta: -286.1MB). Peak memory consumption was 411.7MB. Max. memory is 16.1GB. [2025-03-17 14:40:08,402 INFO L158 Benchmark]: Witness Printer took 133.27ms. Allocated memory is still 746.6MB. Free memory was 360.5MB in the beginning and 353.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:40:08,403 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.99ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.34ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.73ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.4MB in the end (delta: 628.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.04ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 298.84ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 75.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25649.36ms. Allocated memory was 142.6MB in the beginning and 746.6MB in the end (delta: 604.0MB). Free memory was 74.5MB in the beginning and 360.5MB in the end (delta: -286.1MB). Peak memory consumption was 411.7MB. Max. memory is 16.1GB. * Witness Printer took 133.27ms. Allocated memory is still 746.6MB. Free memory was 360.5MB in the beginning and 353.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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, 51 locations, 60 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 138, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7148 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7148 mSDsluCounter, 1288 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 1614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1839 IncrementalHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1614 mSolverCounterUnsat, 435 mSDtfsCounter, 1839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2564 GetRequests, 2234 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4696occurred in iteration=11, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 3158 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3518 ConstructedInterpolants, 0 QuantifiedInterpolants, 10618 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1504 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 102842/183898 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 18 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 45]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 50]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 68]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 70]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 48]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:40:08,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE