./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark24_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark24_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c3b9571ba66fa4feec822ae5ad361f0264abe6d66c7b617817aa135932aee0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:59:11,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:59:11,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:59:11,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:59:11,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:59:11,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:59:11,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:59:11,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:59:11,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:59:11,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:59:11,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:59:11,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:59:11,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:59:11,672 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:59:11,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:59:11,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:59:11,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:59:11,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:59:11,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:59:11,674 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 -> 2c3b9571ba66fa4feec822ae5ad361f0264abe6d66c7b617817aa135932aee0a [2025-03-09 01:59:11,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:59:11,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:59:11,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:59:11,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:59:11,890 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:59:11,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark24_conjunctive.i [2025-03-09 01:59:12,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a070c6912/88f24f72c45d409ab501d4b24dcc41c6/FLAGaaf1936a7 [2025-03-09 01:59:13,170 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:59:13,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark24_conjunctive.i [2025-03-09 01:59:13,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a070c6912/88f24f72c45d409ab501d4b24dcc41c6/FLAGaaf1936a7 [2025-03-09 01:59:13,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a070c6912/88f24f72c45d409ab501d4b24dcc41c6 [2025-03-09 01:59:13,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:59:13,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:59:13,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:59:13,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:59:13,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:59:13,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c63a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13, skipping insertion in model container [2025-03-09 01:59:13,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:59:13,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:59:13,666 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:59:13,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:59:13,687 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:59:13,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13 WrapperNode [2025-03-09 01:59:13,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:59:13,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:59:13,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:59:13,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:59:13,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,708 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-03-09 01:59:13,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:59:13,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:59:13,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:59:13,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:59:13,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,722 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:59:13,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:59:13,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:59:13,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:59:13,726 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:59:13,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (1/1) ... [2025-03-09 01:59:13,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:59:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:13,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:59:13,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:59:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:59:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:59:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:59:13,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:59:13,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:59:13,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:59:13,892 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-09 01:59:13,892 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:59:13,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:59:13,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:59:13,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:59:13 BoogieIcfgContainer [2025-03-09 01:59:13,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:59:13,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:59:13,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:59:13,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:59:13,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:59:13" (1/3) ... [2025-03-09 01:59:13,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413b7cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:59:13, skipping insertion in model container [2025-03-09 01:59:13,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:59:13" (2/3) ... [2025-03-09 01:59:13,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413b7cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:59:13, skipping insertion in model container [2025-03-09 01:59:13,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:59:13" (3/3) ... [2025-03-09 01:59:13,905 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark24_conjunctive.i [2025-03-09 01:59:13,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:59:13,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark24_conjunctive.i that has 1 procedures, 27 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-03-09 01:59:13,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:59:13,957 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;@5fe6048c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:59:13,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 01:59:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:59:13,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:13,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:59:13,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:13,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash 57226395, now seen corresponding path program 1 times [2025-03-09 01:59:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:13,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547131562] [2025-03-09 01:59:13,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:59:14,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:59:14,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547131562] [2025-03-09 01:59:14,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547131562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:59:14,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:59:14,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:59:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424975472] [2025-03-09 01:59:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:59:14,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:59:14,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:59:14,135 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,180 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-03-09 01:59:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:59:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 01:59:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,185 INFO L225 Difference]: With dead ends: 42 [2025-03-09 01:59:14,185 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 01:59:14,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:59:14,189 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:14,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 01:59:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-03-09 01:59:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-09 01:59:14,210 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2025-03-09 01:59:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,210 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-09 01:59:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-09 01:59:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:59:14,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:59:14,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:14,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1774018235, now seen corresponding path program 1 times [2025-03-09 01:59:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:14,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435408061] [2025-03-09 01:59:14,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:59:14,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:59:14,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435408061] [2025-03-09 01:59:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435408061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:59:14,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:59:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:59:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807482166] [2025-03-09 01:59:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:59:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:59:14,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:59:14,255 INFO L87 Difference]: Start difference. First operand 23 states and 24 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-09 01:59:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,276 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-09 01:59:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:59:14,276 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-09 01:59:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,276 INFO L225 Difference]: With dead ends: 23 [2025-03-09 01:59:14,276 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:59:14,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:59:14,277 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:14,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:59:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 01:59:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-09 01:59:14,279 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 6 [2025-03-09 01:59:14,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,280 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-09 01:59:14,280 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-09 01:59:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-09 01:59:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:59:14,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:59:14,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:14,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1774018940, now seen corresponding path program 1 times [2025-03-09 01:59:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:14,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041051499] [2025-03-09 01:59:14,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:59:14,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:59:14,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041051499] [2025-03-09 01:59:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041051499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:59:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:59:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:59:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886067631] [2025-03-09 01:59:14,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:59:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:59:14,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:59:14,326 INFO L87 Difference]: Start difference. First operand 22 states and 23 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-09 01:59:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,362 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2025-03-09 01:59:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:59:14,362 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-09 01:59:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,362 INFO L225 Difference]: With dead ends: 28 [2025-03-09 01:59:14,363 INFO L226 Difference]: Without dead ends: 27 [2025-03-09 01:59:14,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:59:14,363 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:14,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-09 01:59:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-09 01:59:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-09 01:59:14,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 6 [2025-03-09 01:59:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,368 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-09 01:59:14,368 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-09 01:59:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-09 01:59:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:59:14,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:59:14,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -840009575, now seen corresponding path program 1 times [2025-03-09 01:59:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624760168] [2025-03-09 01:59:14,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:59:14,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:59:14,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624760168] [2025-03-09 01:59:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624760168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:59:14,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:59:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:59:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864784168] [2025-03-09 01:59:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:59:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:59:14,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,408 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,419 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-09 01:59:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:59:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 01:59:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,420 INFO L225 Difference]: With dead ends: 23 [2025-03-09 01:59:14,420 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:59:14,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,421 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:14,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:59:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 01:59:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-09 01:59:14,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 7 [2025-03-09 01:59:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,425 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-09 01:59:14,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-09 01:59:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:59:14,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:59:14,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:14,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:14,426 INFO L85 PathProgramCache]: Analyzing trace with hash -839987728, now seen corresponding path program 1 times [2025-03-09 01:59:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:14,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138475833] [2025-03-09 01:59:14,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:59:14,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:59:14,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138475833] [2025-03-09 01:59:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138475833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:59:14,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:59:14,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:59:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042669282] [2025-03-09 01:59:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:59:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:59:14,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,469 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,477 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-03-09 01:59:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:59:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 01:59:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,478 INFO L225 Difference]: With dead ends: 22 [2025-03-09 01:59:14,478 INFO L226 Difference]: Without dead ends: 21 [2025-03-09 01:59:14,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,479 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:14,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-09 01:59:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-09 01:59:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-09 01:59:14,482 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 7 [2025-03-09 01:59:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,482 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-09 01:59:14,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-09 01:59:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:59:14,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:59:14,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -270493063, now seen corresponding path program 1 times [2025-03-09 01:59:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:14,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934746134] [2025-03-09 01:59:14,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:59:14,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:59:14,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934746134] [2025-03-09 01:59:14,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934746134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:59:14,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:59:14,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:59:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746520732] [2025-03-09 01:59:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:59:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:59:14,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,509 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,524 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-09 01:59:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:59:14,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:59:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,525 INFO L225 Difference]: With dead ends: 25 [2025-03-09 01:59:14,525 INFO L226 Difference]: Without dead ends: 24 [2025-03-09 01:59:14,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,525 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 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-09 01:59:14,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-09 01:59:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-09 01:59:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-09 01:59:14,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2025-03-09 01:59:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,531 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-09 01:59:14,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-03-09 01:59:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:59:14,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:59:14,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:14,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -269815814, now seen corresponding path program 1 times [2025-03-09 01:59:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350573351] [2025-03-09 01:59:14,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:59:14,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:59:14,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350573351] [2025-03-09 01:59:14,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350573351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:59:14,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:59:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:59:14,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18731109] [2025-03-09 01:59:14,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:59:14,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:59:14,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,557 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,566 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-03-09 01:59:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:59:14,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:59:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,567 INFO L225 Difference]: With dead ends: 24 [2025-03-09 01:59:14,567 INFO L226 Difference]: Without dead ends: 19 [2025-03-09 01:59:14,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:59:14,568 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:14,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-09 01:59:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-09 01:59:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-03-09 01:59:14,570 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 8 [2025-03-09 01:59:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-03-09 01:59:14,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-03-09 01:59:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:59:14,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,571 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:59:14,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:14,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2049171319, now seen corresponding path program 1 times [2025-03-09 01:59:14,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:14,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27958650] [2025-03-09 01:59:14,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:14,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:59:14,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:59:14,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27958650] [2025-03-09 01:59:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27958650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517469530] [2025-03-09 01:59:14,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:14,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:14,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:14,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:14,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:59:14,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:59:14,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:59:14,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:14,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:14,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:59:14,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517469530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:14,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:14,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:59:14,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634891353] [2025-03-09 01:59:14,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:14,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:59:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:14,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:59:14,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:59:14,777 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:14,871 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-09 01:59:14,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:59:14,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 01:59:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:14,872 INFO L225 Difference]: With dead ends: 37 [2025-03-09 01:59:14,872 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 01:59:14,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:59:14,874 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:14,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:59:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 01:59:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-09 01:59:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-09 01:59:14,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 10 [2025-03-09 01:59:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:14,878 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-09 01:59:14,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-09 01:59:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:59:14,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:14,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:14,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:59:15,084 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-09 01:59:15,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -900197856, now seen corresponding path program 1 times [2025-03-09 01:59:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350220626] [2025-03-09 01:59:15,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:15,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:59:15,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:59:15,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:15,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350220626] [2025-03-09 01:59:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350220626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484907518] [2025-03-09 01:59:15,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:15,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:15,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:15,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:59:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:59:15,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:59:15,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:15,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:59:15,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:15,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:15,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484907518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:15,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:15,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-09 01:59:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554718617] [2025-03-09 01:59:15,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:15,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:59:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:15,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:59:15,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:59:15,351 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:15,451 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-09 01:59:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:59:15,452 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:59:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:15,452 INFO L225 Difference]: With dead ends: 36 [2025-03-09 01:59:15,452 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 01:59:15,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:59:15,453 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:15,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:59:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 01:59:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 01:59:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-09 01:59:15,457 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2025-03-09 01:59:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:15,457 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-09 01:59:15,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-09 01:59:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:59:15,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:15,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:59:15,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:59:15,658 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-09 01:59:15,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:15,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1802391011, now seen corresponding path program 1 times [2025-03-09 01:59:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506087658] [2025-03-09 01:59:15,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:59:15,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:59:15,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506087658] [2025-03-09 01:59:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506087658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685593144] [2025-03-09 01:59:15,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:15,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:15,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:59:15,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:59:15,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:59:15,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:15,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:15,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:59:15,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:15,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:15,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685593144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:15,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:15,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:59:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210059735] [2025-03-09 01:59:15,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:15,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:59:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:15,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:59:15,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:59:15,750 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:15,772 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-03-09 01:59:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:59:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-09 01:59:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:15,773 INFO L225 Difference]: With dead ends: 36 [2025-03-09 01:59:15,773 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 01:59:15,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:59:15,773 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:15,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 01:59:15,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 01:59:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-03-09 01:59:15,778 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 13 [2025-03-09 01:59:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:15,778 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-03-09 01:59:15,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-03-09 01:59:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:59:15,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:15,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:59:15,785 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-09 01:59:15,980 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-09 01:59:15,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:15,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1225941454, now seen corresponding path program 1 times [2025-03-09 01:59:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:15,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377409432] [2025-03-09 01:59:15,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:15,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:59:15,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:59:15,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:15,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377409432] [2025-03-09 01:59:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377409432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086430209] [2025-03-09 01:59:16,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:59:16,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:16,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:16,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:16,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:59:16,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:59:16,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:59:16,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:59:16,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:16,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:59:16,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:16,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:16,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086430209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:16,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:16,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-09 01:59:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295956362] [2025-03-09 01:59:16,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:59:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:16,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:59:16,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:59:16,260 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:16,382 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-03-09 01:59:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:59:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:59:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:16,383 INFO L225 Difference]: With dead ends: 35 [2025-03-09 01:59:16,383 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 01:59:16,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:59:16,384 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:16,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 01:59:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 01:59:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-09 01:59:16,386 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 15 [2025-03-09 01:59:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:16,386 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-09 01:59:16,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-09 01:59:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:59:16,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:16,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:16,392 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-09 01:59:16,587 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-09 01:59:16,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:16,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:16,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1404609632, now seen corresponding path program 2 times [2025-03-09 01:59:16,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:16,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712734676] [2025-03-09 01:59:16,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:59:16,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:16,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:59:16,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:59:16,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:59:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712734676] [2025-03-09 01:59:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712734676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841565714] [2025-03-09 01:59:16,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:59:16,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:16,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:59:16,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:59:16,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:59:16,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:59:16,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:16,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:59:16,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:16,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841565714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:17,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:17,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2025-03-09 01:59:17,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18832225] [2025-03-09 01:59:17,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:59:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:17,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:59:17,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:59:17,093 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:17,389 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-09 01:59:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:59:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 32 states have internal predecessors, (57), 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 21 [2025-03-09 01:59:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:17,390 INFO L225 Difference]: With dead ends: 48 [2025-03-09 01:59:17,390 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 01:59:17,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1349, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 01:59:17,391 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:17,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 18 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:59:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 01:59:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 01:59:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-03-09 01:59:17,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 21 [2025-03-09 01:59:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:17,394 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-03-09 01:59:17,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-03-09 01:59:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:59:17,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:17,395 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-09 01:59:17,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:59:17,598 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-09 01:59:17,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:17,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1755003015, now seen corresponding path program 2 times [2025-03-09 01:59:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402787639] [2025-03-09 01:59:17,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:59:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:17,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:59:17,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:59:17,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:59:17,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402787639] [2025-03-09 01:59:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402787639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915399039] [2025-03-09 01:59:17,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:59:17,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:17,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:17,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:17,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:59:17,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:59:17,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:59:17,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:59:17,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:17,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:59:17,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:17,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:17,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915399039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:17,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:17,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 01:59:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960954950] [2025-03-09 01:59:17,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:17,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:59:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:17,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:59:17,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:59:17,771 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:17,816 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-03-09 01:59:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:59:17,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-09 01:59:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:17,819 INFO L225 Difference]: With dead ends: 63 [2025-03-09 01:59:17,819 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 01:59:17,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:59:17,819 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:17,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 01:59:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-09 01:59:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-09 01:59:17,823 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 28 [2025-03-09 01:59:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:17,823 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-09 01:59:17,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-09 01:59:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 01:59:17,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:17,826 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:17,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:59:18,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:18,026 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:18,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1471434400, now seen corresponding path program 3 times [2025-03-09 01:59:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:18,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057024087] [2025-03-09 01:59:18,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:59:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:18,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 8 equivalence classes. [2025-03-09 01:59:18,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:59:18,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 01:59:18,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057024087] [2025-03-09 01:59:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057024087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:18,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419607481] [2025-03-09 01:59:18,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:59:18,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:18,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:18,270 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:18,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:59:18,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 8 equivalence classes. [2025-03-09 01:59:18,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:59:18,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 01:59:18,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:18,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:59:18,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:18,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:19,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419607481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:19,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24, 24] total 63 [2025-03-09 01:59:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458222001] [2025-03-09 01:59:19,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:19,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-09 01:59:19,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:19,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-09 01:59:19,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=3227, Unknown=0, NotChecked=0, Total=4032 [2025-03-09 01:59:19,321 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 64 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 64 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:20,432 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2025-03-09 01:59:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-09 01:59:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 64 states have internal predecessors, (117), 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 41 [2025-03-09 01:59:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:20,433 INFO L225 Difference]: With dead ends: 88 [2025-03-09 01:59:20,433 INFO L226 Difference]: Without dead ends: 83 [2025-03-09 01:59:20,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3209 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1509, Invalid=6501, Unknown=0, NotChecked=0, Total=8010 [2025-03-09 01:59:20,436 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:20,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:59:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-09 01:59:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-09 01:59:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 82 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2025-03-09 01:59:20,441 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 41 [2025-03-09 01:59:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:20,441 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2025-03-09 01:59:20,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 64 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2025-03-09 01:59:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 01:59:20,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:20,442 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1] [2025-03-09 01:59:20,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:59:20,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:20,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:20,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1735990009, now seen corresponding path program 3 times [2025-03-09 01:59:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658707465] [2025-03-09 01:59:20,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:59:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:20,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-03-09 01:59:20,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:59:20,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:59:20,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658707465] [2025-03-09 01:59:20,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658707465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092267088] [2025-03-09 01:59:20,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:59:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:20,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:20,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:59:20,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-03-09 01:59:20,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:59:20,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:59:20,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:20,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:59:20,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:20,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092267088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:21,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:21,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-09 01:59:21,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269146013] [2025-03-09 01:59:21,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:21,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:59:21,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:21,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:59:21,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:59:21,062 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:21,121 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2025-03-09 01:59:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:59:21,122 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 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 58 [2025-03-09 01:59:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:21,122 INFO L225 Difference]: With dead ends: 123 [2025-03-09 01:59:21,122 INFO L226 Difference]: Without dead ends: 122 [2025-03-09 01:59:21,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:59:21,123 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:21,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:59:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-09 01:59:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-09 01:59:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.075) internal successors, (129), 121 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2025-03-09 01:59:21,129 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 58 [2025-03-09 01:59:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:21,129 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2025-03-09 01:59:21,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2025-03-09 01:59:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 01:59:21,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:21,131 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:21,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:59:21,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:59:21,331 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:21,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 510112928, now seen corresponding path program 4 times [2025-03-09 01:59:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:21,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837919804] [2025-03-09 01:59:21,332 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:59:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:21,336 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-09 01:59:21,350 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 01:59:21,351 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:59:21,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837919804] [2025-03-09 01:59:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837919804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826274631] [2025-03-09 01:59:22,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:59:22,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:22,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:22,042 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:22,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:59:22,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-03-09 01:59:22,086 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 01:59:22,086 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:59:22,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:22,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-09 01:59:22,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:23,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826274631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:24,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:24,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 48, 48] total 127 [2025-03-09 01:59:24,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937989142] [2025-03-09 01:59:24,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:24,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-09 01:59:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:24,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-09 01:59:24,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2961, Invalid=13295, Unknown=0, NotChecked=0, Total=16256 [2025-03-09 01:59:24,634 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 128 states, 127 states have (on average 1.8661417322834646) internal successors, (237), 128 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:28,682 INFO L93 Difference]: Finished difference Result 168 states and 191 transitions. [2025-03-09 01:59:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-09 01:59:28,683 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 1.8661417322834646) internal successors, (237), 128 states have internal predecessors, (237), 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 81 [2025-03-09 01:59:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:28,684 INFO L225 Difference]: With dead ends: 168 [2025-03-09 01:59:28,684 INFO L226 Difference]: Without dead ends: 163 [2025-03-09 01:59:28,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14553 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5989, Invalid=28421, Unknown=0, NotChecked=0, Total=34410 [2025-03-09 01:59:28,689 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 2825 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:28,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 55 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2825 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 01:59:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-09 01:59:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-09 01:59:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.062111801242236) internal successors, (171), 162 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2025-03-09 01:59:28,698 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 81 [2025-03-09 01:59:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:28,699 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2025-03-09 01:59:28,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 1.8661417322834646) internal successors, (237), 128 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2025-03-09 01:59:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 01:59:28,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:28,700 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1, 1, 1] [2025-03-09 01:59:28,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:59:28,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:59:28,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:28,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2117312007, now seen corresponding path program 4 times [2025-03-09 01:59:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946031130] [2025-03-09 01:59:28,904 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:59:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:28,908 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-03-09 01:59:28,917 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 01:59:28,917 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:59:28,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946031130] [2025-03-09 01:59:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946031130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619157967] [2025-03-09 01:59:29,279 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:59:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:29,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:29,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:59:29,304 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-03-09 01:59:29,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 01:59:29,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:59:29,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:29,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 01:59:29,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:29,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619157967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:29,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-09 01:59:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937508812] [2025-03-09 01:59:29,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:29,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 01:59:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:29,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 01:59:29,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:59:29,972 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand has 48 states, 47 states have (on average 4.9787234042553195) internal successors, (234), 48 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:30,090 INFO L93 Difference]: Finished difference Result 243 states and 281 transitions. [2025-03-09 01:59:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 01:59:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.9787234042553195) internal successors, (234), 48 states have internal predecessors, (234), 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 118 [2025-03-09 01:59:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:30,091 INFO L225 Difference]: With dead ends: 243 [2025-03-09 01:59:30,091 INFO L226 Difference]: Without dead ends: 242 [2025-03-09 01:59:30,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 01:59:30,092 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:30,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:59:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-09 01:59:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-09 01:59:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.0708333333333333) internal successors, (257), 241 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2025-03-09 01:59:30,103 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2025-03-09 01:59:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:30,103 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2025-03-09 01:59:30,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.9787234042553195) internal successors, (234), 48 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2025-03-09 01:59:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-09 01:59:30,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:30,104 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2025-03-09 01:59:30,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:59:30,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:59:30,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:59:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 137658528, now seen corresponding path program 5 times [2025-03-09 01:59:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452062901] [2025-03-09 01:59:30,305 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:59:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:30,312 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 161 statements into 32 equivalence classes. [2025-03-09 01:59:30,339 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 161 of 161 statements. [2025-03-09 01:59:30,339 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-09 01:59:30,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452062901] [2025-03-09 01:59:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452062901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107557081] [2025-03-09 01:59:32,138 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:59:32,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:32,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:32,140 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:32,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:59:32,170 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 161 statements into 32 equivalence classes. [2025-03-09 01:59:32,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 161 of 161 statements. [2025-03-09 01:59:32,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-09 01:59:32,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:32,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-09 01:59:32,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:35,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:40,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107557081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:40,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:40,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 96, 96] total 255 [2025-03-09 01:59:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052147876] [2025-03-09 01:59:40,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:40,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2025-03-09 01:59:40,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:40,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2025-03-09 01:59:40,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11305, Invalid=53975, Unknown=0, NotChecked=0, Total=65280 [2025-03-09 01:59:40,904 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand has 256 states, 255 states have (on average 1.8705882352941177) internal successors, (477), 256 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:00:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:00:01,491 INFO L93 Difference]: Finished difference Result 328 states and 375 transitions. [2025-03-09 02:00:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2025-03-09 02:00:01,492 INFO L78 Accepts]: Start accepts. Automaton has has 256 states, 255 states have (on average 1.8705882352941177) internal successors, (477), 256 states have internal predecessors, (477), 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 161 [2025-03-09 02:00:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:00:01,493 INFO L225 Difference]: With dead ends: 328 [2025-03-09 02:00:01,493 INFO L226 Difference]: Without dead ends: 323 [2025-03-09 02:00:01,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61817 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=23781, Invalid=118725, Unknown=0, NotChecked=0, Total=142506 [2025-03-09 02:00:01,498 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10538 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 10538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:00:01,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 112 Invalid, 10602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 10538 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-09 02:00:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-09 02:00:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-09 02:00:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 321 states have (on average 1.0560747663551402) internal successors, (339), 322 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:00:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 339 transitions. [2025-03-09 02:00:01,522 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 339 transitions. Word has length 161 [2025-03-09 02:00:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:00:01,522 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 339 transitions. [2025-03-09 02:00:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 256 states, 255 states have (on average 1.8705882352941177) internal successors, (477), 256 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:00:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 339 transitions. [2025-03-09 02:00:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-09 02:00:01,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:00:01,527 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1, 1, 1] [2025-03-09 02:00:01,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:00:01,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:00:01,732 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:00:01,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:00:01,732 INFO L85 PathProgramCache]: Analyzing trace with hash -482512903, now seen corresponding path program 5 times [2025-03-09 02:00:01,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:00:01,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138805459] [2025-03-09 02:00:01,733 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:00:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:00:01,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes. [2025-03-09 02:00:01,781 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 238 of 238 statements. [2025-03-09 02:00:01,781 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:00:01,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:00:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:00:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:00:02,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138805459] [2025-03-09 02:00:02,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138805459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:00:02,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190692127] [2025-03-09 02:00:02,810 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:00:02,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:00:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:00:02,812 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:00:02,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:00:02,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes. [2025-03-09 02:00:02,908 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 238 of 238 statements. [2025-03-09 02:00:02,908 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 02:00:02,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:00:02,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 02:00:02,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:00:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:00:03,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:00:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:00:04,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190692127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:00:04,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:00:04,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-09 02:00:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784587020] [2025-03-09 02:00:04,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:00:04,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-09 02:00:04,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:00:04,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-09 02:00:04,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 02:00:04,968 INFO L87 Difference]: Start difference. First operand 323 states and 339 transitions. Second operand has 96 states, 95 states have (on average 4.989473684210527) internal successors, (474), 96 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:00:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:00:05,304 INFO L93 Difference]: Finished difference Result 483 states and 561 transitions. [2025-03-09 02:00:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-09 02:00:05,305 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.989473684210527) internal successors, (474), 96 states have internal predecessors, (474), 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 238 [2025-03-09 02:00:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:00:05,306 INFO L225 Difference]: With dead ends: 483 [2025-03-09 02:00:05,307 INFO L226 Difference]: Without dead ends: 482 [2025-03-09 02:00:05,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 02:00:05,308 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:00:05,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:00:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-09 02:00:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-03-09 02:00:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 480 states have (on average 1.06875) internal successors, (513), 481 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:00:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 513 transitions. [2025-03-09 02:00:05,330 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 513 transitions. Word has length 238 [2025-03-09 02:00:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:00:05,330 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 513 transitions. [2025-03-09 02:00:05,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.989473684210527) internal successors, (474), 96 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:00:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 513 transitions. [2025-03-09 02:00:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-09 02:00:05,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:00:05,333 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2025-03-09 02:00:05,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:00:05,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:00:05,537 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:00:05,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:00:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash 895883424, now seen corresponding path program 6 times [2025-03-09 02:00:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:00:05,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374282169] [2025-03-09 02:00:05,537 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:00:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:00:05,547 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 321 statements into 64 equivalence classes. [2025-03-09 02:00:05,651 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 321 of 321 statements. [2025-03-09 02:00:05,652 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-03-09 02:00:05,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:00:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:00:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:00:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374282169] [2025-03-09 02:00:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374282169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:00:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056291528] [2025-03-09 02:00:12,851 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:00:12,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:00:12,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:00:12,853 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:00:12,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:00:12,886 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 321 statements into 64 equivalence classes. [2025-03-09 02:00:12,977 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 321 of 321 statements. [2025-03-09 02:00:12,977 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-03-09 02:00:12,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:00:12,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 193 conjuncts are in the unsatisfiable core [2025-03-09 02:00:12,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:00:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:00:23,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:00:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:00:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056291528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:00:45,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:00:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 192, 192] total 511 [2025-03-09 02:00:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803676025] [2025-03-09 02:00:45,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:00:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 512 states [2025-03-09 02:00:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:00:45,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 512 interpolants. [2025-03-09 02:00:45,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44121, Invalid=217511, Unknown=0, NotChecked=0, Total=261632 [2025-03-09 02:00:45,495 INFO L87 Difference]: Start difference. First operand 482 states and 513 transitions. Second operand has 512 states, 511 states have (on average 1.8727984344422701) internal successors, (957), 512 states have internal predecessors, (957), 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)