./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/max10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:38:08,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:38:08,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:38:08,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:38:08,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:38:08,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:38:08,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:38:08,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:38:08,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:38:08,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:38:08,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:38:08,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:38:08,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:38:08,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:38:08,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:38:08,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:38:08,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:08,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:38:08,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:38:08,619 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 -> 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e [2025-03-17 14:38:08,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:38:08,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:38:08,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:38:08,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:38:08,860 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:38:08,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max10-1.i [2025-03-17 14:38:09,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72935ebc/528961acd48d4c56adb30438e85f31b1/FLAG318ac0925 [2025-03-17 14:38:10,233 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:38:10,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2025-03-17 14:38:10,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72935ebc/528961acd48d4c56adb30438e85f31b1/FLAG318ac0925 [2025-03-17 14:38:10,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f72935ebc/528961acd48d4c56adb30438e85f31b1 [2025-03-17 14:38:10,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:38:10,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:38:10,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:10,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:38:10,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:38:10,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10, skipping insertion in model container [2025-03-17 14:38:10,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:38:10,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:10,697 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:38:10,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:10,728 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:38:10,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10 WrapperNode [2025-03-17 14:38:10,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:10,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:10,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:38:10,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:38:10,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,755 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-03-17 14:38:10,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:10,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:38:10,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:38:10,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:38:10,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,776 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-17 14:38:10,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:38:10,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:38:10,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:38:10,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:38:10,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (1/1) ... [2025-03-17 14:38:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:10,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:10,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:38:10,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:38:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:38:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-17 14:38:10,850 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:38:10,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:38:10,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:38:10,898 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:38:10,900 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:38:11,053 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-17 14:38:11,069 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 14:38:11,069 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:38:11,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:38:11,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:38:11,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:11 BoogieIcfgContainer [2025-03-17 14:38:11,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:38:11,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:38:11,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:38:11,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:38:11,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:38:10" (1/3) ... [2025-03-17 14:38:11,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eecce28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:11, skipping insertion in model container [2025-03-17 14:38:11,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:10" (2/3) ... [2025-03-17 14:38:11,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eecce28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:11, skipping insertion in model container [2025-03-17 14:38:11,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:11" (3/3) ... [2025-03-17 14:38:11,093 INFO L128 eAbstractionObserver]: Analyzing ICFG max10-1.i [2025-03-17 14:38:11,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:38:11,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max10-1.i that has 2 procedures, 38 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-17 14:38:11,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:38:11,164 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;@7b8f980f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:38:11,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:38:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.56) internal successors, (39), 33 states have internal predecessors, (39), 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-17 14:38:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:38:11,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:11,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:38:11,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:11,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash 71464, now seen corresponding path program 1 times [2025-03-17 14:38:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184324992] [2025-03-17 14:38:11,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:38:11,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:38:11,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:11,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:11,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184324992] [2025-03-17 14:38:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184324992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:11,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949376700] [2025-03-17 14:38:11,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:11,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:11,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:11,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:11,399 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.56) internal successors, (39), 33 states have internal predecessors, (39), 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 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:11,454 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-03-17 14:38:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 14:38:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:11,460 INFO L225 Difference]: With dead ends: 74 [2025-03-17 14:38:11,461 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 14:38:11,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-17 14:38:11,468 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:11,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 14:38:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 14:38:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-17 14:38:11,511 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 3 [2025-03-17 14:38:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:11,511 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 14:38:11,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-17 14:38:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:11,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:11,512 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:38:11,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:38:11,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:11,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2128991101, now seen corresponding path program 1 times [2025-03-17 14:38:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:11,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68609884] [2025-03-17 14:38:11,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:11,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:11,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:11,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:11,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:11,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:11,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:11,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68609884] [2025-03-17 14:38:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68609884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:11,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097345353] [2025-03-17 14:38:11,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:11,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:11,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:11,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:11,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:38:11,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:11,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:11,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:11,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:11,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:11,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:11,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097345353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360997020] [2025-03-17 14:38:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:11,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:38:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:11,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:38:11,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:38:11,752 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:11,783 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-17 14:38:11,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:38:11,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:38:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:11,785 INFO L225 Difference]: With dead ends: 33 [2025-03-17 14:38:11,785 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:38:11,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:38:11,786 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:11,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:38:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 14:38:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-17 14:38:11,793 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 6 [2025-03-17 14:38:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:11,793 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-17 14:38:11,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-17 14:38:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:38:11,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:11,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 14:38:11,800 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-17 14:38:11,994 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-17 14:38:11,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1574214698, now seen corresponding path program 1 times [2025-03-17 14:38:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915758643] [2025-03-17 14:38:11,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:12,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:38:12,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:38:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:38:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915758643] [2025-03-17 14:38:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915758643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769531017] [2025-03-17 14:38:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:12,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:12,053 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:12,060 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-17 14:38:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:38:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:12,061 INFO L225 Difference]: With dead ends: 32 [2025-03-17 14:38:12,062 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 14:38:12,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:12,063 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:12,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 14:38:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-03-17 14:38:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-03-17 14:38:12,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 7 [2025-03-17 14:38:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:12,068 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-03-17 14:38:12,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-03-17 14:38:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:38:12,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:12,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:12,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:38:12,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:12,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash -239207172, now seen corresponding path program 1 times [2025-03-17 14:38:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-03-17 14:38:12,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:12,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:38:12,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:38:12,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:12,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-03-17 14:38:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581900342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937053318] [2025-03-17 14:38:12,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:12,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:12,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:38:12,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:38:12,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:38:12,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:12,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:12,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:12,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937053318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:12,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:38:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909538035] [2025-03-17 14:38:12,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:12,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:12,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:12,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:12,260 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:12,299 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-03-17 14:38:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:38:12,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:38:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:12,302 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:38:12,302 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 14:38:12,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:12,303 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:12,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 14:38:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-17 14:38:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-17 14:38:12,308 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2025-03-17 14:38:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:12,308 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-17 14:38:12,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-17 14:38:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:38:12,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:12,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:12,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:38:12,511 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-17 14:38:12,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:12,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -689356580, now seen corresponding path program 2 times [2025-03-17 14:38:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:12,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075996348] [2025-03-17 14:38:12,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:12,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 14:38:12,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 17 statements. [2025-03-17 14:38:12,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:12,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:12,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:12,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075996348] [2025-03-17 14:38:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075996348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:12,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:12,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052465258] [2025-03-17 14:38:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:12,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:12,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:12,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:12,577 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:12,596 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-03-17 14:38:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:12,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 14:38:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:12,598 INFO L225 Difference]: With dead ends: 63 [2025-03-17 14:38:12,598 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 14:38:12,598 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-17 14:38:12,598 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:12,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 14:38:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-03-17 14:38:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-17 14:38:12,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 17 [2025-03-17 14:38:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:12,607 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-17 14:38:12,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-17 14:38:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:38:12,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:12,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:12,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:38:12,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:12,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash 104782471, now seen corresponding path program 1 times [2025-03-17 14:38:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:12,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352348505] [2025-03-17 14:38:12,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:12,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:38:12,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:38:12,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:12,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352348505] [2025-03-17 14:38:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352348505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:12,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261243790] [2025-03-17 14:38:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:12,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:12,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:12,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:12,712 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:12,733 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-03-17 14:38:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:12,734 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:38:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:12,734 INFO L225 Difference]: With dead ends: 41 [2025-03-17 14:38:12,735 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 14:38:12,735 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-17 14:38:12,735 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:12,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 14:38:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 14:38:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-17 14:38:12,740 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2025-03-17 14:38:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:12,740 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-17 14:38:12,740 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-03-17 14:38:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:38:12,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:12,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:12,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:38:12,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:12,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1096425053, now seen corresponding path program 1 times [2025-03-17 14:38:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269860785] [2025-03-17 14:38:12,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:12,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:38:12,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:38:12,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269860785] [2025-03-17 14:38:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269860785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150618307] [2025-03-17 14:38:12,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:12,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:12,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:38:12,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:38:12,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:38:12,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:12,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:12,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:38:12,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:12,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150618307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:13,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 14:38:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369333919] [2025-03-17 14:38:13,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 14:38:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:13,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 14:38:13,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:38:13,062 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:13,114 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2025-03-17 14:38:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 14:38:13,115 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 14:38:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:13,115 INFO L225 Difference]: With dead ends: 81 [2025-03-17 14:38:13,115 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:38:13,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:38:13,116 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:13,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:38:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 14:38:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-17 14:38:13,124 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 22 [2025-03-17 14:38:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:13,125 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-17 14:38:13,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-17 14:38:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 14:38:13,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:13,125 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:13,132 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-17 14:38:13,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:13,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:13,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1638110749, now seen corresponding path program 2 times [2025-03-17 14:38:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:13,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277116467] [2025-03-17 14:38:13,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:13,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:38:13,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:38:13,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:38:13,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 14:38:13,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:13,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277116467] [2025-03-17 14:38:13,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277116467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:13,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389158469] [2025-03-17 14:38:13,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:13,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:13,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:13,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:13,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:38:13,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:38:13,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:38:13,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:38:13,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:13,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:38:13,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:13,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389158469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:13,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 25 [2025-03-17 14:38:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104289350] [2025-03-17 14:38:13,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:13,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 14:38:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:13,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 14:38:13,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:38:13,944 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:14,041 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2025-03-17 14:38:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 14:38:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 14:38:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:14,042 INFO L225 Difference]: With dead ends: 89 [2025-03-17 14:38:14,042 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 14:38:14,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:38:14,043 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:14,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 217 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 14:38:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 14:38:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-17 14:38:14,047 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 34 [2025-03-17 14:38:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:14,047 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-17 14:38:14,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-17 14:38:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 14:38:14,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:14,048 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:14,054 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-17 14:38:14,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:14,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:14,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -158315819, now seen corresponding path program 1 times [2025-03-17 14:38:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759727981] [2025-03-17 14:38:14,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:14,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 14:38:14,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 14:38:14,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:14,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 14:38:14,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:14,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759727981] [2025-03-17 14:38:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759727981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390366793] [2025-03-17 14:38:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:14,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:14,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:14,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:14,309 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:14,321 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-03-17 14:38:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:14,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-17 14:38:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:14,324 INFO L225 Difference]: With dead ends: 60 [2025-03-17 14:38:14,324 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 14:38:14,324 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-17 14:38:14,324 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:14,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 14:38:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-17 14:38:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-03-17 14:38:14,334 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 44 [2025-03-17 14:38:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:14,334 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-03-17 14:38:14,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-03-17 14:38:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 14:38:14,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:14,335 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:14,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:38:14,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:14,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1255881512, now seen corresponding path program 1 times [2025-03-17 14:38:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:14,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530984530] [2025-03-17 14:38:14,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:14,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 14:38:14,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 14:38:14,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:14,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 14:38:14,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:14,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530984530] [2025-03-17 14:38:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530984530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:14,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308613652] [2025-03-17 14:38:14,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:14,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:14,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:14,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:14,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:38:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 14:38:14,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 14:38:14,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:14,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:14,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:38:14,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 14:38:14,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:14,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308613652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:14,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:14,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-17 14:38:14,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528014095] [2025-03-17 14:38:14,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:14,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:14,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:14,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:14,516 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:14,527 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-03-17 14:38:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-17 14:38:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:14,528 INFO L225 Difference]: With dead ends: 58 [2025-03-17 14:38:14,528 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 14:38:14,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:14,528 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:14,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 14:38:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-03-17 14:38:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-03-17 14:38:14,532 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 56 [2025-03-17 14:38:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-03-17 14:38:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-03-17 14:38:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 14:38:14,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:14,534 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:14,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:14,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:38:14,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:14,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -277621211, now seen corresponding path program 1 times [2025-03-17 14:38:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:14,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304656463] [2025-03-17 14:38:14,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:14,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:14,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:38:14,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:38:14,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 14:38:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304656463] [2025-03-17 14:38:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304656463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919179366] [2025-03-17 14:38:14,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:14,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:14,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:38:14,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:38:14,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:38:14,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:14,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:14,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:38:14,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 14:38:14,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919179366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:14,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-17 14:38:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595045774] [2025-03-17 14:38:14,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:14,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:14,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:14,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:14,904 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:14,914 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-03-17 14:38:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:14,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-17 14:38:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:14,915 INFO L225 Difference]: With dead ends: 58 [2025-03-17 14:38:14,915 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 14:38:14,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:14,916 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:14,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 14:38:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 14:38:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-03-17 14:38:14,919 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 57 [2025-03-17 14:38:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:14,919 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-03-17 14:38:14,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-03-17 14:38:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 14:38:14,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:14,920 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:14,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:38:15,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:15,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash -16322954, now seen corresponding path program 1 times [2025-03-17 14:38:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:15,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707353140] [2025-03-17 14:38:15,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:15,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 14:38:15,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:38:15,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:15,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 14:38:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:15,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707353140] [2025-03-17 14:38:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707353140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:15,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651929650] [2025-03-17 14:38:15,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:15,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:15,216 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:15,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:38:15,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 14:38:15,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:38:15,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:15,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:15,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:15,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 14:38:15,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 14:38:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651929650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:15,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:38:15,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638077743] [2025-03-17 14:38:15,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:15,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:15,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:15,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:15,350 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 14:38:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:15,395 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2025-03-17 14:38:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:38:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2025-03-17 14:38:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:15,396 INFO L225 Difference]: With dead ends: 91 [2025-03-17 14:38:15,396 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 14:38:15,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:15,396 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:15,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 14:38:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 14:38:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-03-17 14:38:15,406 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 58 [2025-03-17 14:38:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:15,406 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-03-17 14:38:15,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 14:38:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-03-17 14:38:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 14:38:15,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:15,407 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:15,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:15,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:15,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:15,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 555099702, now seen corresponding path program 2 times [2025-03-17 14:38:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:15,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-03-17 14:38:15,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:15,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:15,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-17 14:38:15,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 78 statements. [2025-03-17 14:38:15,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:15,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-17 14:38:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-03-17 14:38:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156395231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281905579] [2025-03-17 14:38:15,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:15,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:15,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:15,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:15,647 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:15,662 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-03-17 14:38:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2025-03-17 14:38:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:15,664 INFO L225 Difference]: With dead ends: 71 [2025-03-17 14:38:15,664 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 14:38:15,664 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-17 14:38:15,664 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:15,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 14:38:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 14:38:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2025-03-17 14:38:15,668 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 78 [2025-03-17 14:38:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2025-03-17 14:38:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2025-03-17 14:38:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 14:38:15,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:15,669 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:15,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:38:15,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1351125985, now seen corresponding path program 1 times [2025-03-17 14:38:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487505091] [2025-03-17 14:38:15,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:15,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 14:38:15,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 14:38:15,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:15,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-17 14:38:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487505091] [2025-03-17 14:38:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487505091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903536336] [2025-03-17 14:38:15,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:15,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:15,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:15,772 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:15,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:38:15,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 14:38:15,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 14:38:15,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:15,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:15,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:38:15,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 53 proven. 18 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-17 14:38:15,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-17 14:38:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903536336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:16,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:16,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 19 [2025-03-17 14:38:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923440684] [2025-03-17 14:38:16,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 14:38:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 14:38:16,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:38:16,024 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 14:38:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:16,118 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2025-03-17 14:38:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:38:16,118 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2025-03-17 14:38:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:16,119 INFO L225 Difference]: With dead ends: 128 [2025-03-17 14:38:16,119 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 14:38:16,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:38:16,120 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:16,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 166 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 14:38:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-17 14:38:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 87 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2025-03-17 14:38:16,129 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 81 [2025-03-17 14:38:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:16,129 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2025-03-17 14:38:16,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 14:38:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2025-03-17 14:38:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 14:38:16,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:16,133 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:16,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:38:16,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:38:16,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:16,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2085707844, now seen corresponding path program 1 times [2025-03-17 14:38:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-17 14:38:16,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:16,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 14:38:16,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 14:38:16,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:16,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-17 14:38:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-17 14:38:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120358721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701317210] [2025-03-17 14:38:16,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:16,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:16,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:16,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:16,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:16,436 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:16,446 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-03-17 14:38:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:16,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 122 [2025-03-17 14:38:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:16,447 INFO L225 Difference]: With dead ends: 91 [2025-03-17 14:38:16,447 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 14:38:16,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:16,449 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:16,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 14:38:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 14:38:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 86 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-03-17 14:38:16,457 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 122 [2025-03-17 14:38:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:16,457 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-03-17 14:38:16,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-03-17 14:38:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 14:38:16,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:16,460 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:16,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:38:16,460 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:16,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash -232433729, now seen corresponding path program 1 times [2025-03-17 14:38:16,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:16,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598036298] [2025-03-17 14:38:16,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:16,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 14:38:16,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 14:38:16,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-17 14:38:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598036298] [2025-03-17 14:38:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598036298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:16,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073449202] [2025-03-17 14:38:16,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:16,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:16,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:16,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:16,539 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:16,552 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2025-03-17 14:38:16,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:16,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 123 [2025-03-17 14:38:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:16,553 INFO L225 Difference]: With dead ends: 90 [2025-03-17 14:38:16,553 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 14:38:16,553 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-17 14:38:16,554 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:16,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 14:38:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-03-17 14:38:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:38:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2025-03-17 14:38:16,559 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 123 [2025-03-17 14:38:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2025-03-17 14:38:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2025-03-17 14:38:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 14:38:16,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:16,560 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:16,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:38:16,560 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 14:38:16,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1384488986, now seen corresponding path program 1 times [2025-03-17 14:38:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:16,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211621101] [2025-03-17 14:38:16,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:16,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 14:38:16,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 14:38:16,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:16,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-17 14:38:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211621101] [2025-03-17 14:38:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211621101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945554174] [2025-03-17 14:38:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:16,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:16,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:16,648 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:16,660 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-03-17 14:38:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 124 [2025-03-17 14:38:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:16,661 INFO L225 Difference]: With dead ends: 86 [2025-03-17 14:38:16,661 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:38:16,661 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-17 14:38:16,663 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:16,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:38:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:38:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:38:16,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2025-03-17 14:38:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:16,664 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:38:16,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:38:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:38:16,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:38:16,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 14:38:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 14:38:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 14:38:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 14:38:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 14:38:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 14:38:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 14:38:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 14:38:16,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:38:16,670 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:16,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:38:16,695 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:38:16,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:38:16 BoogieIcfgContainer [2025-03-17 14:38:16,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:38:16,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:38:16,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:38:16,705 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:38:16,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:11" (3/4) ... [2025-03-17 14:38:16,707 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:38:16,711 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure max [2025-03-17 14:38:16,715 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 14:38:16,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:38:16,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:38:16,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:38:16,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:38:16,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:38:16,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:38:16,778 INFO L158 Benchmark]: Toolchain (without parser) took 6216.99ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 111.4MB in the end (delta: 12.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2025-03-17 14:38:16,778 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:16,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.26ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 113.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:16,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.89ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.4MB in the end (delta: 794.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:16,778 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:16,779 INFO L158 Benchmark]: IcfgBuilder took 288.73ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 95.6MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:16,779 INFO L158 Benchmark]: TraceAbstraction took 5621.49ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 116.8MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:16,779 INFO L158 Benchmark]: Witness Printer took 71.95ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 111.4MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:16,781 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.26ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 113.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.89ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.4MB in the end (delta: 794.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 288.73ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 95.6MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5621.49ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 116.8MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.95ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 111.4MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 48 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 17, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 1729 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1285 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 612 IncrementalHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 444 mSDtfsCounter, 612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 469 SyntacticMatches, 11 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=14, InterpolantAutomatonStates: 118, 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, 17 MinimizatonAttempts, 11 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1186 NumberOfCodeBlocks, 1111 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 1782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1516 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 4096/4418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 43]: Location Invariant Derived location invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 20]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:38:16,800 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