./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test22-1.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 e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:51:42,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:51:42,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:51:42,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:51:42,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:51:42,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:51:42,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:51:42,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:51:42,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:51:42,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:51:42,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:51:42,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:51:42,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:51:42,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:51:42,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:51:42,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:51:42,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:51:42,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:51:42,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:51:42,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:51:42,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:51:42,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:51:42,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:51:42,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:51:42,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:51:42,655 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 -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2025-03-09 01:51:42,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:51:42,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:51:42,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:51:42,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:51:42,895 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:51:42,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2025-03-09 01:51:44,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d940b3d6/1e70a8bde6274b61aab0d9a1725259a6/FLAG4cbbaae13 [2025-03-09 01:51:44,273 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:51:44,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2025-03-09 01:51:44,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d940b3d6/1e70a8bde6274b61aab0d9a1725259a6/FLAG4cbbaae13 [2025-03-09 01:51:44,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d940b3d6/1e70a8bde6274b61aab0d9a1725259a6 [2025-03-09 01:51:44,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:51:44,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:51:44,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:51:44,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:51:44,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:51:44,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160e6a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44, skipping insertion in model container [2025-03-09 01:51:44,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:51:44,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:51:44,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:51:44,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:51:44,776 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:51:44,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44 WrapperNode [2025-03-09 01:51:44,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:51:44,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:51:44,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:51:44,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:51:44,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,805 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2025-03-09 01:51:44,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:51:44,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:51:44,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:51:44,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:51:44,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,830 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2025-03-09 01:51:44,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:51:44,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:51:44,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:51:44,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:51:44,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (1/1) ... [2025-03-09 01:51:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:51:44,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:51:44,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:51:44,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:51:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:51:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:51:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:51:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:51:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:51:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2025-03-09 01:51:44,890 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2025-03-09 01:51:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:51:44,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:51:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:51:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:51:44,940 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:51:44,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:51:44,972 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~nondet8; [2025-03-09 01:51:45,051 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: havoc check_#t~mem9#1; [2025-03-09 01:51:45,059 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-09 01:51:45,059 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:51:45,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:51:45,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:51:45,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:51:45 BoogieIcfgContainer [2025-03-09 01:51:45,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:51:45,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:51:45,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:51:45,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:51:45,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:51:44" (1/3) ... [2025-03-09 01:51:45,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331b40bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:51:45, skipping insertion in model container [2025-03-09 01:51:45,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:51:44" (2/3) ... [2025-03-09 01:51:45,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331b40bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:51:45, skipping insertion in model container [2025-03-09 01:51:45,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:51:45" (3/3) ... [2025-03-09 01:51:45,071 INFO L128 eAbstractionObserver]: Analyzing ICFG test22-1.c [2025-03-09 01:51:45,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:51:45,082 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test22-1.c that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-09 01:51:45,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:51:45,134 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;@2d84627d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:51:45,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:51:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:51:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:51:45,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:51:45,142 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:51:45,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:51:45,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:51:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1374366883, now seen corresponding path program 1 times [2025-03-09 01:51:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:51:45,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38368717] [2025-03-09 01:51:45,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:45,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:51:45,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:51:45,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:51:45,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:51:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:51:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38368717] [2025-03-09 01:51:45,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38368717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:51:45,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:51:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:51:45,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077112749] [2025-03-09 01:51:45,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:51:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:51:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:51:45,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:51:45,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:51:45,518 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:51:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:51:45,575 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-03-09 01:51:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:51:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-03-09 01:51:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:51:45,582 INFO L225 Difference]: With dead ends: 41 [2025-03-09 01:51:45,582 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 01:51:45,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:51:45,585 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:51:45,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:51:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 01:51:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 01:51:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:51:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-09 01:51:45,610 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2025-03-09 01:51:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:51:45,611 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-09 01:51:45,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:51:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-09 01:51:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:51:45,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:51:45,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:51:45,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:51:45,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:51:45,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:51:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash -344299591, now seen corresponding path program 1 times [2025-03-09 01:51:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:51:45,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364333139] [2025-03-09 01:51:45,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:51:45,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:51:45,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:51:45,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:45,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:51:46,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364333139] [2025-03-09 01:51:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364333139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:51:46,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840552209] [2025-03-09 01:51:46,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:46,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:51:46,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:51:46,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:51:46,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:51:46,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:51:46,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:46,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:46,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:51:46,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:51:46,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:51:46,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 1 [2025-03-09 01:51:46,362 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-09 01:51:47,192 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2025-03-09 01:51:47,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 64 [2025-03-09 01:51:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:51:47,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:51:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840552209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:51:47,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:51:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2025-03-09 01:51:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074950446] [2025-03-09 01:51:47,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:51:47,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:51:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:51:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:51:47,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:51:47,717 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 21 states have internal predecessors, (39), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-09 01:51:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:51:48,082 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-09 01:51:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:51:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 21 states have internal predecessors, (39), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 22 [2025-03-09 01:51:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:51:48,083 INFO L225 Difference]: With dead ends: 24 [2025-03-09 01:51:48,083 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 01:51:48,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:51:48,084 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 61 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:51:48,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 83 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:51:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 01:51:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-09 01:51:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:51:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-09 01:51:48,089 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2025-03-09 01:51:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:51:48,090 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-09 01:51:48,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 21 states have internal predecessors, (39), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-09 01:51:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-09 01:51:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:51:48,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:51:48,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:51:48,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:51:48,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:48,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:51:48,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:51:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash -647218657, now seen corresponding path program 1 times [2025-03-09 01:51:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:51:48,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008234631] [2025-03-09 01:51:48,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:51:48,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:51:48,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:51:48,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:48,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:51:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:51:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008234631] [2025-03-09 01:51:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008234631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:51:48,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:51:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:51:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751144354] [2025-03-09 01:51:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:51:48,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:51:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:51:48,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:51:48,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:51:48,348 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:51:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:51:48,362 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-03-09 01:51:48,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:51:48,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-09 01:51:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:51:48,363 INFO L225 Difference]: With dead ends: 22 [2025-03-09 01:51:48,363 INFO L226 Difference]: Without dead ends: 21 [2025-03-09 01:51:48,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:51:48,364 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:51:48,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:51:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-09 01:51:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-09 01:51:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:51:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-09 01:51:48,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 25 [2025-03-09 01:51:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:51:48,369 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-09 01:51:48,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:51:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-09 01:51:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:51:48,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:51:48,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:51:48,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:51:48,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:51:48,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:51:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1411058101, now seen corresponding path program 1 times [2025-03-09 01:51:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:51:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193894811] [2025-03-09 01:51:48,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:51:48,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:51:48,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:51:48,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:48,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:51:48,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193894811] [2025-03-09 01:51:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193894811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:51:48,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305719236] [2025-03-09 01:51:48,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:48,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:51:48,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:51:48,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:51:48,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:51:48,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:51:48,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:48,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:48,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 01:51:48,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:51:48,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2025-03-09 01:51:48,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 01:51:48,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-09 01:51:49,265 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:51:49,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:51:49,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2025-03-09 01:51:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:51:49,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:51:49,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:51:49,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 66 [2025-03-09 01:51:49,739 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:51:49,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 68 [2025-03-09 01:51:49,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-03-09 01:51:49,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-09 01:51:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305719236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:51:49,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:51:49,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 31 [2025-03-09 01:51:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861119022] [2025-03-09 01:51:49,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:51:49,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:51:49,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:51:49,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:51:49,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:51:49,781 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 32 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-09 01:51:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:51:50,212 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-09 01:51:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:51:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2025-03-09 01:51:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:51:50,213 INFO L225 Difference]: With dead ends: 31 [2025-03-09 01:51:50,213 INFO L226 Difference]: Without dead ends: 30 [2025-03-09 01:51:50,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 01:51:50,214 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 136 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:51:50,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 63 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:51:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-09 01:51:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-09 01:51:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:51:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-03-09 01:51:50,218 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2025-03-09 01:51:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:51:50,218 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-09 01:51:50,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-09 01:51:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-03-09 01:51:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:51:50,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:51:50,219 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:51:50,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:51:50,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:51:50,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:51:50,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:51:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash 489632685, now seen corresponding path program 1 times [2025-03-09 01:51:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:51:50,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979226782] [2025-03-09 01:51:50,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:51:50,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:51:50,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:51:50,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:50,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:50,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:51:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979226782] [2025-03-09 01:51:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979226782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:51:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220321485] [2025-03-09 01:51:50,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:51:50,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:50,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:51:50,827 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:51:50,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:51:50,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:51:50,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:51:50,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:51:50,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:50,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:51:50,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:51:50,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2025-03-09 01:51:50,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2025-03-09 01:51:50,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 01:51:50,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 01:51:51,252 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:51:51,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:51:51,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2025-03-09 01:51:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:51:51,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:51:51,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:51:51,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 66 [2025-03-09 01:51:51,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:51:51,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 74 [2025-03-09 01:51:51,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 127 [2025-03-09 01:51:51,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-09 01:51:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220321485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:51:51,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:51:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 35 [2025-03-09 01:51:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751790225] [2025-03-09 01:51:51,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:51:51,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:51:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:51:51,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:51:51,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1106, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:51:51,816 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 36 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-09 01:51:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:51:52,345 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-03-09 01:51:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:51:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 34 [2025-03-09 01:51:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:51:52,346 INFO L225 Difference]: With dead ends: 47 [2025-03-09 01:51:52,346 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 01:51:52,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=464, Invalid=1986, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 01:51:52,347 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 182 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:51:52,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 75 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:51:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 01:51:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-03-09 01:51:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:51:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-03-09 01:51:52,367 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 34 [2025-03-09 01:51:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:51:52,368 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-03-09 01:51:52,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 8 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-09 01:51:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-03-09 01:51:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:51:52,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:51:52,368 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:51:52,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:51:52,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:52,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:51:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:51:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1534648419, now seen corresponding path program 2 times [2025-03-09 01:51:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:51:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-03-09 01:51:52,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:51:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:51:52,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:51:52,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:51:52,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:51:52,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 86 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:51:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-03-09 01:51:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516478184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:51:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181813688] [2025-03-09 01:51:52,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:51:52,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:52,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:51:52,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:51:52,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:51:53,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:51:53,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:51:53,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:51:53,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:53,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 01:51:53,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:51:53,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2025-03-09 01:51:53,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 01:51:53,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-09 01:51:53,383 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:51:53,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:51:53,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2025-03-09 01:51:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:51:53,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:51:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 86 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:51:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181813688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:51:53,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:51:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 36 [2025-03-09 01:51:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180742718] [2025-03-09 01:51:53,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:51:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 01:51:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:51:53,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 01:51:53,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1156, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 01:51:53,800 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 37 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 33 states have internal predecessors, (80), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-09 01:51:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:51:54,303 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-03-09 01:51:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:51:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 33 states have internal predecessors, (80), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 50 [2025-03-09 01:51:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:51:54,306 INFO L225 Difference]: With dead ends: 63 [2025-03-09 01:51:54,306 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 01:51:54,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=533, Invalid=2119, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 01:51:54,307 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 157 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:51:54,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 82 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:51:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 01:51:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-09 01:51:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:51:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-09 01:51:54,317 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 50 [2025-03-09 01:51:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:51:54,317 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-09 01:51:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 33 states have internal predecessors, (80), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-09 01:51:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-09 01:51:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 01:51:54,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:51:54,318 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:51:54,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:51:54,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:54,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:51:54,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:51:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash 736701325, now seen corresponding path program 3 times [2025-03-09 01:51:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:51:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133885040] [2025-03-09 01:51:54,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:51:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:51:54,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-03-09 01:51:54,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 66 statements. [2025-03-09 01:51:54,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:51:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-09 01:51:54,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:51:54,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133885040] [2025-03-09 01:51:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133885040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:51:54,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019694053] [2025-03-09 01:51:54,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:51:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:54,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:51:54,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:51:54,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:51:54,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-03-09 01:51:54,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 66 statements. [2025-03-09 01:51:54,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:51:54,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:51:54,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:51:54,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:51:54,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2025-03-09 01:51:54,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 01:51:54,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-09 01:51:55,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:51:55,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2025-03-09 01:51:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-09 01:51:55,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:51:56,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:51:56,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 66 [2025-03-09 01:51:56,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:51:56,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2025-03-09 01:51:56,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 119 [2025-03-09 01:51:56,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-09 01:51:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-09 01:51:56,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019694053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:51:56,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:51:56,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34 [2025-03-09 01:51:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243604742] [2025-03-09 01:51:56,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:51:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:51:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:51:56,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:51:56,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:51:56,101 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 35 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 29 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 01:51:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:51:56,506 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-03-09 01:51:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:51:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 29 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 66 [2025-03-09 01:51:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:51:56,510 INFO L225 Difference]: With dead ends: 62 [2025-03-09 01:51:56,510 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:51:56,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=323, Invalid=1569, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 01:51:56,511 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:51:56,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 75 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:51:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:51:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:51:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:51:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:51:56,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2025-03-09 01:51:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:51:56,512 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:51:56,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 29 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 01:51:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:51:56,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:51:56,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 01:51:56,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 01:51:56,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 01:51:56,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 01:51:56,522 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-09 01:51:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:51:56,717 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-03-09 01:51:56,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:51:57,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:51:57,011 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pd2~0!base,]]] [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~short15 [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!offset [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2025-03-09 01:51:57,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!offset [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!base [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!offset [2025-03-09 01:51:57,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pd2~0!base [2025-03-09 01:51:57,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:51:57 BoogieIcfgContainer [2025-03-09 01:51:57,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:51:57,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:51:57,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:51:57,015 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:51:57,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:51:45" (3/4) ... [2025-03-09 01:51:57,017 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:51:57,020 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_dummy [2025-03-09 01:51:57,022 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-09 01:51:57,022 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 01:51:57,022 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:51:57,023 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:51:57,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:51:57,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:51:57,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:51:57,079 INFO L158 Benchmark]: Toolchain (without parser) took 12459.07ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 106.6MB in the beginning and 193.4MB in the end (delta: -86.8MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. [2025-03-09 01:51:57,079 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:51:57,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.02ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:51:57,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.75ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:51:57,079 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:51:57,080 INFO L158 Benchmark]: IcfgBuilder took 225.45ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 78.5MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:51:57,080 INFO L158 Benchmark]: TraceAbstraction took 11947.84ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 78.5MB in the beginning and 197.5MB in the end (delta: -119.0MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2025-03-09 01:51:57,080 INFO L158 Benchmark]: Witness Printer took 63.82ms. Allocated memory is still 352.3MB. Free memory was 197.5MB in the beginning and 193.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:51:57,081 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.02ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.75ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 225.45ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 78.5MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11947.84ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 78.5MB in the beginning and 197.5MB in the end (delta: -119.0MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Witness Printer took 63.82ms. Allocated memory is still 352.3MB. Free memory was 197.5MB in the beginning and 193.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pd2~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~short15 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pd2~0!base * 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: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: 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 2 procedures, 33 locations, 42 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 624 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 403 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1219 IncrementalHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 96 mSDtfsCounter, 1219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 10 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=6, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 442 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 623 ConstructedInterpolants, 8 QuantifiedInterpolants, 7966 SizeOfPredicates, 60 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 667/1101 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 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: (0 <= (i + 2147483648)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:51:57,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE