./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pnr4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pnr4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2f943c7ce97bf9be3e11b9d2df150d740ebe8f456342884d8ad0d40610fb008 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:38:49,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:38:49,734 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:49,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:38:49,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:38:49,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:38:49,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:38:49,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:38:49,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:38:49,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:38:49,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:38:49,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:38:49,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:38:49,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:38:49,763 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:38:49,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:38:49,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:38:49,763 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:38:49,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:38:49,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:38:49,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:38:49,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:38:49,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:38:49,764 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:38:49,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:38:49,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:38:49,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:38:49,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:49,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:38:49,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:38:49,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:38:49,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:38:49,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:38:49,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:38:49,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:38:49,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:38:49,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:38:49,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:38:49,766 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 -> c2f943c7ce97bf9be3e11b9d2df150d740ebe8f456342884d8ad0d40610fb008 [2025-03-17 14:38:50,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:38:50,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:38:50,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:38:50,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:38:50,123 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:38:50,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr4.c [2025-03-17 14:38:51,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ca950da/59586f783cab4391a47c2473a96527a4/FLAG6af832eda [2025-03-17 14:38:51,587 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:38:51,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr4.c [2025-03-17 14:38:51,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ca950da/59586f783cab4391a47c2473a96527a4/FLAG6af832eda [2025-03-17 14:38:51,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ca950da/59586f783cab4391a47c2473a96527a4 [2025-03-17 14:38:51,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:38:51,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:38:51,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:51,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:38:51,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:38:51,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:51" (1/1) ... [2025-03-17 14:38:51,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47613426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:51, skipping insertion in model container [2025-03-17 14:38:51,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:51" (1/1) ... [2025-03-17 14:38:51,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:38:52,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:52,050 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:38:52,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:52,073 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:38:52,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:52 WrapperNode [2025-03-17 14:38:52,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:52,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:52,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:38:52,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:38:52,079 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:52" (1/1) ... [2025-03-17 14:38:52,085 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:52" (1/1) ... [2025-03-17 14:38:52,099 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2025-03-17 14:38:52,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:52,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:38:52,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:38:52,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:38:52,105 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:52" (1/1) ... [2025-03-17 14:38:52,105 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:52" (1/1) ... [2025-03-17 14:38:52,107 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:52" (1/1) ... [2025-03-17 14:38:52,120 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 7, 9]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 8 writes are split as follows [0, 0, 8]. [2025-03-17 14:38:52,120 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:52" (1/1) ... [2025-03-17 14:38:52,120 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:52" (1/1) ... [2025-03-17 14:38:52,124 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:52" (1/1) ... [2025-03-17 14:38:52,125 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:52" (1/1) ... [2025-03-17 14:38:52,126 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:52" (1/1) ... [2025-03-17 14:38:52,126 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:52" (1/1) ... [2025-03-17 14:38:52,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:38:52,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:38:52,128 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:38:52,128 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:38:52,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:52" (1/1) ... [2025-03-17 14:38:52,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:52,160 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:52,167 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:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:38:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:38:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:38:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2025-03-17 14:38:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:38:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:38:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:38:52,251 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:38:52,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:38:52,547 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-17 14:38:52,548 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:38:52,555 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:38:52,555 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:38:52,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:52 BoogieIcfgContainer [2025-03-17 14:38:52,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:38:52,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:38:52,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:38:52,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:38:52,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:38:51" (1/3) ... [2025-03-17 14:38:52,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665ca5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:52, skipping insertion in model container [2025-03-17 14:38:52,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:52" (2/3) ... [2025-03-17 14:38:52,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665ca5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:52, skipping insertion in model container [2025-03-17 14:38:52,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:52" (3/3) ... [2025-03-17 14:38:52,566 INFO L128 eAbstractionObserver]: Analyzing ICFG pnr4.c [2025-03-17 14:38:52,579 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:38:52,580 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pnr4.c that has 2 procedures, 106 locations, 1 initial locations, 2 loop locations, and 38 error locations. [2025-03-17 14:38:52,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:38:52,623 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;@6c923d5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:38:52,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-17 14:38:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 62 states have (on average 1.7903225806451613) internal successors, (111), 100 states have internal predecessors, (111), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:38:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:52,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:52,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:52,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:52,636 INFO L85 PathProgramCache]: Analyzing trace with hash 51855351, now seen corresponding path program 1 times [2025-03-17 14:38:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:52,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227137986] [2025-03-17 14:38:52,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:52,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:52,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:52,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:52,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:52,767 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:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227137986] [2025-03-17 14:38:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227137986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030893243] [2025-03-17 14:38:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:38:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:38:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:52,792 INFO L87 Difference]: Start difference. First operand has 106 states, 62 states have (on average 1.7903225806451613) internal successors, (111), 100 states have internal predecessors, (111), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:52,815 INFO L93 Difference]: Finished difference Result 208 states and 231 transitions. [2025-03-17 14:38:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:38:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:38:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:52,822 INFO L225 Difference]: With dead ends: 208 [2025-03-17 14:38:52,822 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 14:38:52,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:52,829 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:52,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 14:38:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 14:38:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.728813559322034) internal successors, (102), 96 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:38:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2025-03-17 14:38:52,861 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 6 [2025-03-17 14:38:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:52,862 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2025-03-17 14:38:52,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2025-03-17 14:38:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:52,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:52,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:52,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:38:52,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:52,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 51856312, now seen corresponding path program 1 times [2025-03-17 14:38:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417476215] [2025-03-17 14:38:52,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:52,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:52,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:52,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:53,047 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:53,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:53,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417476215] [2025-03-17 14:38:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417476215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:53,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:53,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186759513] [2025-03-17 14:38:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:53,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:53,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:53,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:53,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:53,049 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:53,079 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2025-03-17 14:38:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:53,082 INFO L225 Difference]: With dead ends: 102 [2025-03-17 14:38:53,082 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 14:38:53,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:53,082 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 102 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:53,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 102 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:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 14:38:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 14:38:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 95 states have internal predecessors, (101), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:38:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-03-17 14:38:53,091 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 6 [2025-03-17 14:38:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:53,091 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-03-17 14:38:53,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-03-17 14:38:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:38:53,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:53,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:53,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:38:53,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:53,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1607545744, now seen corresponding path program 1 times [2025-03-17 14:38:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509908564] [2025-03-17 14:38:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:53,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:38:53,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:38:53,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:53,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:53,266 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:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509908564] [2025-03-17 14:38:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509908564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:53,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317858778] [2025-03-17 14:38:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:53,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:53,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:53,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:53,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:53,272 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:53,356 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2025-03-17 14:38:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:53,359 INFO L225 Difference]: With dead ends: 101 [2025-03-17 14:38:53,359 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 14:38:53,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:53,361 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 287 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:53,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 14:38:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 14:38:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.694915254237288) internal successors, (100), 94 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:38:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-03-17 14:38:53,375 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 7 [2025-03-17 14:38:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:53,379 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-03-17 14:38:53,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-03-17 14:38:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:38:53,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:53,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:53,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:38:53,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:53,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1767972042, now seen corresponding path program 1 times [2025-03-17 14:38:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191530095] [2025-03-17 14:38:53,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:53,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:38:53,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:38:53,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:53,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:53,456 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:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191530095] [2025-03-17 14:38:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191530095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:53,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:53,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:53,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401226832] [2025-03-17 14:38:53,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:53,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:53,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:53,458 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:53,580 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2025-03-17 14:38:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-17 14:38:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:53,581 INFO L225 Difference]: With dead ends: 107 [2025-03-17 14:38:53,581 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 14:38:53,582 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:53,582 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:53,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 14:38:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 14:38:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 64 states have (on average 1.640625) internal successors, (105), 99 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:38:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-03-17 14:38:53,597 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 13 [2025-03-17 14:38:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:53,597 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-03-17 14:38:53,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-03-17 14:38:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:38:53,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:53,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:53,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:38:53,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:53,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash -607026044, now seen corresponding path program 1 times [2025-03-17 14:38:53,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:53,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865082126] [2025-03-17 14:38:53,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:53,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:38:53,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:38:53,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:53,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:53,640 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:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865082126] [2025-03-17 14:38:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865082126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:53,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895457837] [2025-03-17 14:38:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:53,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:53,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:53,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:53,642 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:38:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:53,779 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2025-03-17 14:38:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:53,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 14:38:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:53,780 INFO L225 Difference]: With dead ends: 185 [2025-03-17 14:38:53,780 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 14:38:53,781 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:53,781 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 42 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:53,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 14:38:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-17 14:38:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 142 states have internal predecessors, (153), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 14:38:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2025-03-17 14:38:53,796 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 15 [2025-03-17 14:38:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2025-03-17 14:38:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:38:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2025-03-17 14:38:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:38:53,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:53,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:53,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:38:53,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:53,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1828554225, now seen corresponding path program 1 times [2025-03-17 14:38:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:53,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127903716] [2025-03-17 14:38:53,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:53,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:38:53,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:38:53,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:53,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:38:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127903716] [2025-03-17 14:38:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127903716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:53,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:38:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627154819] [2025-03-17 14:38:53,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:53,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:53,929 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,083 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2025-03-17 14:38:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:38:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,085 INFO L225 Difference]: With dead ends: 166 [2025-03-17 14:38:54,086 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 14:38:54,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:54,086 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 149 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 87 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 14:38:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-17 14:38:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 142 states have internal predecessors, (152), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 14:38:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2025-03-17 14:38:54,101 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 18 [2025-03-17 14:38:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,102 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2025-03-17 14:38:54,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2025-03-17 14:38:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 14:38:54,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,103 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:38:54,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:54,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash -610580676, now seen corresponding path program 1 times [2025-03-17 14:38:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205204299] [2025-03-17 14:38:54,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 14:38:54,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 14:38:54,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:38:54,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205204299] [2025-03-17 14:38:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205204299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982878595] [2025-03-17 14:38:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:54,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:54,176 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:38:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,292 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2025-03-17 14:38:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-03-17 14:38:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,293 INFO L225 Difference]: With dead ends: 157 [2025-03-17 14:38:54,293 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 14:38:54,294 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:54,294 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 173 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 14:38:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-17 14:38:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 145 states have internal predecessors, (155), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 14:38:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2025-03-17 14:38:54,301 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 50 [2025-03-17 14:38:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,301 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2025-03-17 14:38:54,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:38:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2025-03-17 14:38:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 14:38:54,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,302 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:38:54,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:54,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash -478319065, now seen corresponding path program 1 times [2025-03-17 14:38:54,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190792261] [2025-03-17 14:38:54,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 14:38:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 14:38:54,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 14:38:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190792261] [2025-03-17 14:38:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190792261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067983673] [2025-03-17 14:38:54,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:54,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:54,411 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:54,413 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:54,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 14:38:54,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 14:38:54,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:54,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 14:38:54,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:54,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067983673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006710738] [2025-03-17 14:38:54,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:54,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:54,582 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 14:38:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,753 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2025-03-17 14:38:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-03-17 14:38:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,755 INFO L225 Difference]: With dead ends: 155 [2025-03-17 14:38:54,758 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 14:38:54,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:54,759 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 62 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 163 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:38:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 14:38:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 14:38:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 128 states have internal predecessors, (138), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 14:38:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2025-03-17 14:38:54,769 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 61 [2025-03-17 14:38:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,769 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2025-03-17 14:38:54,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 14:38:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2025-03-17 14:38:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 14:38:54,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,773 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,779 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:54,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:54,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:54,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1942989073, now seen corresponding path program 1 times [2025-03-17 14:38:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906259646] [2025-03-17 14:38:54,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 14:38:54,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 14:38:54,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 14:38:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906259646] [2025-03-17 14:38:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906259646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210763052] [2025-03-17 14:38:55,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:55,079 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:55,080 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:55,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 14:38:55,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 14:38:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:55,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 14:38:55,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 14:38:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210763052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:55,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:55,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:38:55,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440513872] [2025-03-17 14:38:55,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:55,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:55,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:55,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:55,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:55,305 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 10 states have internal predecessors, (113), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-17 14:38:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:55,478 INFO L93 Difference]: Finished difference Result 201 states and 245 transitions. [2025-03-17 14:38:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:38:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 10 states have internal predecessors, (113), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 62 [2025-03-17 14:38:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:55,480 INFO L225 Difference]: With dead ends: 201 [2025-03-17 14:38:55,480 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 14:38:55,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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:55,480 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 146 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:55,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 149 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:38:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 14:38:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-17 14:38:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 1.1272727272727272) internal successors, (186), 169 states have internal predecessors, (186), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 14:38:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2025-03-17 14:38:55,488 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 62 [2025-03-17 14:38:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:55,489 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2025-03-17 14:38:55,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 10 states have internal predecessors, (113), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-17 14:38:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2025-03-17 14:38:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 14:38:55,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:55,490 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:55,496 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:55,690 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,SelfDestructingSolverStorable8 [2025-03-17 14:38:55,691 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1370229132, now seen corresponding path program 1 times [2025-03-17 14:38:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668245013] [2025-03-17 14:38:55,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:55,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 14:38:55,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 14:38:55,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:38:55,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668245013] [2025-03-17 14:38:55,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668245013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358833983] [2025-03-17 14:38:55,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:55,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:55,773 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:55,775 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:55,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 14:38:55,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 14:38:55,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:55,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:38:55,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358833983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 14:38:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122651514] [2025-03-17 14:38:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:38:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:55,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:38:55,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:38:55,872 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:38:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:56,001 INFO L93 Difference]: Finished difference Result 184 states and 212 transitions. [2025-03-17 14:38:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:38:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2025-03-17 14:38:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:56,003 INFO L225 Difference]: With dead ends: 184 [2025-03-17 14:38:56,003 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 14:38:56,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 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:56,004 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:56,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 169 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 14:38:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-17 14:38:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 165 states have (on average 1.121212121212121) internal successors, (185), 168 states have internal predecessors, (185), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 14:38:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2025-03-17 14:38:56,012 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 64 [2025-03-17 14:38:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:56,012 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2025-03-17 14:38:56,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:38:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2025-03-17 14:38:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 14:38:56,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:56,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:56,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:56,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:56,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:56,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash -472569892, now seen corresponding path program 1 times [2025-03-17 14:38:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:56,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017809736] [2025-03-17 14:38:56,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:56,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 14:38:56,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:38:56,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:56,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:38:56,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017809736] [2025-03-17 14:38:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017809736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576078235] [2025-03-17 14:38:56,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:56,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:56,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:56,297 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:56,298 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:56,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 14:38:56,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:38:56,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:56,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:56,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:38:56,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:38:56,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576078235] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:56,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:56,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:38:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558787725] [2025-03-17 14:38:56,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:56,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:38:56,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:56,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:38:56,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:38:56,421 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:38:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:56,571 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2025-03-17 14:38:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:38:56,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2025-03-17 14:38:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:56,572 INFO L225 Difference]: With dead ends: 199 [2025-03-17 14:38:56,572 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 14:38:56,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:38:56,573 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 168 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:56,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 180 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 14:38:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-17 14:38:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 180 states have (on average 1.1111111111111112) internal successors, (200), 183 states have internal predecessors, (200), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 14:38:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2025-03-17 14:38:56,580 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 65 [2025-03-17 14:38:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:56,580 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2025-03-17 14:38:56,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:38:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2025-03-17 14:38:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 14:38:56,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:56,581 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:56,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:56,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:56,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:56,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -694572625, now seen corresponding path program 2 times [2025-03-17 14:38:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163646521] [2025-03-17 14:38:56,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:56,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-17 14:38:56,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 80 statements. [2025-03-17 14:38:56,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:56,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:38:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163646521] [2025-03-17 14:38:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163646521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819465835] [2025-03-17 14:38:56,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:56,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:56,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:56,847 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:56,848 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:56,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-17 14:38:56,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 80 statements. [2025-03-17 14:38:56,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:56,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:38:56,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:38:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819465835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:57,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:57,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2025-03-17 14:38:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647571694] [2025-03-17 14:38:57,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:57,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:38:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:38:57,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:38:57,083 INFO L87 Difference]: Start difference. First operand 198 states and 226 transitions. Second operand has 9 states, 8 states have (on average 12.25) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 14:38:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:57,194 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2025-03-17 14:38:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:38:57,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.25) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-17 14:38:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:57,195 INFO L225 Difference]: With dead ends: 198 [2025-03-17 14:38:57,195 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 14:38:57,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:38:57,196 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 138 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:57,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 69 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 14:38:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2025-03-17 14:38:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.089655172413793) internal successors, (158), 145 states have internal predecessors, (158), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 14:38:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2025-03-17 14:38:57,203 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 80 [2025-03-17 14:38:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:57,203 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2025-03-17 14:38:57,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.25) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 14:38:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2025-03-17 14:38:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 14:38:57,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:57,204 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,210 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:57,405 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,SelfDestructingSolverStorable11 [2025-03-17 14:38:57,405 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-17 14:38:57,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1051983045, now seen corresponding path program 1 times [2025-03-17 14:38:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571152412] [2025-03-17 14:38:57,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:57,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 14:38:57,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 14:38:57,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:57,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-17 14:38:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571152412] [2025-03-17 14:38:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571152412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:57,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:57,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564954824] [2025-03-17 14:38:57,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:57,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:57,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:57,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:57,511 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 14:38:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:57,559 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2025-03-17 14:38:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:57,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 143 [2025-03-17 14:38:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:57,560 INFO L225 Difference]: With dead ends: 159 [2025-03-17 14:38:57,560 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:38:57,560 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:57,561 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:57,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 71 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:38:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:38:57,563 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:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:38:57,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-03-17 14:38:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:57,563 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:38:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 14:38:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:38:57,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:38:57,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2025-03-17 14:38:57,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2025-03-17 14:38:57,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2025-03-17 14:38:57,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2025-03-17 14:38:57,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2025-03-17 14:38:57,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2025-03-17 14:38:57,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2025-03-17 14:38:57,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2025-03-17 14:38:57,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2025-03-17 14:38:57,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2025-03-17 14:38:57,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2025-03-17 14:38:57,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2025-03-17 14:38:57,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2025-03-17 14:38:57,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:38:57,572 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:38:57,828 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:38:57,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:38:57 BoogieIcfgContainer [2025-03-17 14:38:57,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:38:57,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:38:57,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:38:57,843 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:38:57,844 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:52" (3/4) ... [2025-03-17 14:38:57,845 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:38:57,849 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2025-03-17 14:38:57,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 14:38:57,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 14:38:57,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:38:57,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:38:57,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:38:57,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:38:57,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:38:57,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:38:57,925 INFO L158 Benchmark]: Toolchain (without parser) took 6019.86ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 71.6MB in the end (delta: 41.4MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-03-17 14:38:57,926 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 226.5MB. Free memory was 146.3MB in the beginning and 146.0MB in the end (delta: 293.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:57,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.03ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:57,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.52ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:57,926 INFO L158 Benchmark]: Boogie Preprocessor took 28.20ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:57,926 INFO L158 Benchmark]: IcfgBuilder took 427.15ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 79.1MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:38:57,928 INFO L158 Benchmark]: TraceAbstraction took 5285.43ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 77.6MB in the end (delta: 991.3kB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2025-03-17 14:38:57,928 INFO L158 Benchmark]: Witness Printer took 81.52ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 71.6MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:57,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 226.5MB. Free memory was 146.3MB in the beginning and 146.0MB in the end (delta: 293.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.03ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.52ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.20ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 427.15ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 79.1MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5285.43ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 77.6MB in the end (delta: 991.3kB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Witness Printer took 81.52ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 71.6MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 79]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 123 edges, 38 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1220 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1192 mSDsluCounter, 1723 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 862 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1660 IncrementalHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 861 mSDtfsCounter, 1660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 527 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=11, InterpolantAutomatonStates: 67, 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, 13 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 922 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1108 ConstructedInterpolants, 0 QuantifiedInterpolants, 2336 SizeOfPredicates, 2 NumberOfNonLiveVariables, 851 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 753/851 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 38 specifications checked. All of them hold - InvariantResult [Line: 79]: Location Invariant Derived location invariant: ((((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (i == 0)) && (2 <= SIZE)) && (SIZE <= 99999)) && (MAX <= 100000)) || ((((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (1 <= i)) && (2 <= SIZE)) && (i <= 2147483646)) && (SIZE <= 99999)) && (MAX <= 100000))) - InvariantResult [Line: 36]: Location Invariant Derived location invariant: ((((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (2 <= SIZE)) && (2 <= i)) && (SIZE <= 99999)) && (MAX <= 100000)) || (((((((SIZE >= 0) ? (SIZE % 4) : ((SIZE % 4) + 4)) == 0) && (2 <= SIZE)) && (i == 1)) && (SIZE <= 99999)) && (MAX <= 100000))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:38:57,949 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