./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark41_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 e8c2a2f5606e46c1a328e1728dc6cdf6823e5c50ed56fab8310a8cb7bd30fe62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:02:44,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:02:44,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:02:44,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:02:44,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:02:44,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:02:44,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:02:44,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:02:44,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:02:44,983 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:02:44,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:02:44,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:02:44,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:02:44,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:02:44,984 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:02:44,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:02:44,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:02:44,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:02:44,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:02:44,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:02:44,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:02:44,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:02:44,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:02:44,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:02:44,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:02:44,987 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 -> e8c2a2f5606e46c1a328e1728dc6cdf6823e5c50ed56fab8310a8cb7bd30fe62 [2025-03-17 15:02:45,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:02:45,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:02:45,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:02:45,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:02:45,210 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:02:45,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i [2025-03-17 15:02:46,322 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4155e52/58d78626f17b412382515ae8b6b82068/FLAG9aad387e7 [2025-03-17 15:02:46,520 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:02:46,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark41_conjunctive.i [2025-03-17 15:02:46,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4155e52/58d78626f17b412382515ae8b6b82068/FLAG9aad387e7 [2025-03-17 15:02:46,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4155e52/58d78626f17b412382515ae8b6b82068 [2025-03-17 15:02:46,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:02:46,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:02:46,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:02:46,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:02:46,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:02:46,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:46" (1/1) ... [2025-03-17 15:02:46,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:46, skipping insertion in model container [2025-03-17 15:02:46,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:46" (1/1) ... [2025-03-17 15:02:46,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:02:47,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:02:47,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:02:47,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:02:47,036 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:02:47,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47 WrapperNode [2025-03-17 15:02:47,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:02:47,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:02:47,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:02:47,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:02:47,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,056 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-17 15:02:47,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:02:47,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:02:47,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:02:47,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:02:47,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,074 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-17 15:02:47,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:02:47,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:02:47,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:02:47,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:02:47,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (1/1) ... [2025-03-17 15:02:47,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:02:47,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:47,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:02:47,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:02:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:02:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:02:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:02:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:02:47,154 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:02:47,155 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:02:47,261 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-17 15:02:47,261 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:02:47,267 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:02:47,267 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:02:47,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:47 BoogieIcfgContainer [2025-03-17 15:02:47,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:02:47,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:02:47,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:02:47,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:02:47,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:02:46" (1/3) ... [2025-03-17 15:02:47,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af99607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:47, skipping insertion in model container [2025-03-17 15:02:47,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:47" (2/3) ... [2025-03-17 15:02:47,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af99607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:47, skipping insertion in model container [2025-03-17 15:02:47,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:47" (3/3) ... [2025-03-17 15:02:47,275 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark41_conjunctive.i [2025-03-17 15:02:47,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:02:47,287 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark41_conjunctive.i that has 1 procedures, 34 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-17 15:02:47,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:02:47,334 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;@62ad1c9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:02:47,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 15:02:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:02:47,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:47,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:02:47,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash 67720864, now seen corresponding path program 1 times [2025-03-17 15:02:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:47,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986483969] [2025-03-17 15:02:47,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:47,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:02:47,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:02:47,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:47,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986483969] [2025-03-17 15:02:47,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986483969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:47,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:47,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:02:47,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482431165] [2025-03-17 15:02:47,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:47,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:47,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:47,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:47,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,534 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 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), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:47,599 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-17 15:02:47,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:47,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:02:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:47,604 INFO L225 Difference]: With dead ends: 56 [2025-03-17 15:02:47,604 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 15:02:47,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,609 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:47,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 42 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 15:02:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 15:02:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.5625) internal successors, (25), 24 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-17 15:02:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-17 15:02:47,631 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 5 [2025-03-17 15:02:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:47,631 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-17 15:02:47,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-17 15:02:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:02:47,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:47,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:02:47,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:02:47,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:47,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2099346782, now seen corresponding path program 1 times [2025-03-17 15:02:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314184101] [2025-03-17 15:02:47,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:47,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:02:47,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:02:47,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:47,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314184101] [2025-03-17 15:02:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314184101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:47,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:47,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:47,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698998679] [2025-03-17 15:02:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:47,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:47,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:47,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:47,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,687 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:47,728 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-03-17 15:02:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:02:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:47,729 INFO L225 Difference]: With dead ends: 36 [2025-03-17 15:02:47,730 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 15:02:47,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,730 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:47,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 15:02:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2025-03-17 15:02:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.5) internal successors, (30), 28 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-17 15:02:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-03-17 15:02:47,737 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 6 [2025-03-17 15:02:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:47,737 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-03-17 15:02:47,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-03-17 15:02:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:02:47,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:47,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:47,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:02:47,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:47,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 655200084, now seen corresponding path program 1 times [2025-03-17 15:02:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:47,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515973198] [2025-03-17 15:02:47,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:47,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:47,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:02:47,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:02:47,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:47,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:47,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515973198] [2025-03-17 15:02:47,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515973198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:47,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:02:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478807127] [2025-03-17 15:02:47,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:47,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:47,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:47,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,788 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:47,835 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-03-17 15:02:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:02:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:02:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:47,836 INFO L225 Difference]: With dead ends: 36 [2025-03-17 15:02:47,837 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 15:02:47,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:02:47,838 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:47,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 41 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 15:02:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-17 15:02:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.434782608695652) 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-17 15:02:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-17 15:02:47,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 7 [2025-03-17 15:02:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:47,841 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-17 15:02:47,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-17 15:02:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:02:47,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:47,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:02:47,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash 655240798, now seen corresponding path program 1 times [2025-03-17 15:02:47,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:47,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157261485] [2025-03-17 15:02:47,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:47,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:47,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:02:47,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:02:47,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:47,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:47,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157261485] [2025-03-17 15:02:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157261485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:47,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946587403] [2025-03-17 15:02:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:47,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:47,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:47,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,903 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:47,931 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2025-03-17 15:02:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:47,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:02:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:47,932 INFO L225 Difference]: With dead ends: 32 [2025-03-17 15:02:47,933 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 15:02:47,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,935 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 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-17 15:02:47,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 15:02:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 15:02:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-03-17 15:02:47,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 7 [2025-03-17 15:02:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:47,939 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-03-17 15:02:47,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-03-17 15:02:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 15:02:47,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:47,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:47,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:02:47,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:47,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1163633893, now seen corresponding path program 1 times [2025-03-17 15:02:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:47,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535328639] [2025-03-17 15:02:47,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:47,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 15:02:47,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 15:02:47,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:47,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:47,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:47,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535328639] [2025-03-17 15:02:47,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535328639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:47,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:47,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:02:47,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942151043] [2025-03-17 15:02:47,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:47,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:47,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:47,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:47,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:47,980 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,015 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2025-03-17 15:02:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:48,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 15:02:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,016 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:02:48,016 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 15:02:48,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:02:48,017 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:48,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 15:02:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 15:02:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.375) 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-17 15:02:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-17 15:02:48,022 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 8 [2025-03-17 15:02:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,022 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-17 15:02:48,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-17 15:02:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 15:02:48,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:02:48,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1162371748, now seen corresponding path program 1 times [2025-03-17 15:02:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882955259] [2025-03-17 15:02:48,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 15:02:48,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 15:02:48,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882955259] [2025-03-17 15:02:48,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882955259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:48,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:48,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178145014] [2025-03-17 15:02:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:48,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:48,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:48,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:48,069 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,104 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-03-17 15:02:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:48,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 15:02:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,105 INFO L225 Difference]: With dead ends: 37 [2025-03-17 15:02:48,105 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 15:02:48,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:48,105 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:48,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 15:02:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-17 15:02:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 33 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-17 15:02:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-03-17 15:02:48,109 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 8 [2025-03-17 15:02:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,109 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-03-17 15:02:48,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-03-17 15:02:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 15:02:48,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:02:48,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1712912334, now seen corresponding path program 1 times [2025-03-17 15:02:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916825466] [2025-03-17 15:02:48,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 15:02:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 15:02:48,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916825466] [2025-03-17 15:02:48,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916825466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:48,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:48,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:02:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319718186] [2025-03-17 15:02:48,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:48,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:02:48,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:48,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:02:48,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:02:48,163 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,208 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-17 15:02:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:48,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 15:02:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,209 INFO L225 Difference]: With dead ends: 37 [2025-03-17 15:02:48,209 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 15:02:48,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:02:48,209 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:48,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 15:02:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-17 15:02:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 34 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-17 15:02:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-17 15:02:48,212 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 9 [2025-03-17 15:02:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,212 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-17 15:02:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-17 15:02:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 15:02:48,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:02:48,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1673785828, now seen corresponding path program 1 times [2025-03-17 15:02:48,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105231356] [2025-03-17 15:02:48,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 15:02:48,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 15:02:48,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105231356] [2025-03-17 15:02:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105231356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:48,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:48,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:02:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561370367] [2025-03-17 15:02:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:48,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:02:48,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:48,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:02:48,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:48,231 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,244 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-17 15:02:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:02:48,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 15:02:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,245 INFO L225 Difference]: With dead ends: 39 [2025-03-17 15:02:48,245 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 15:02:48,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:48,245 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:48,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 15:02:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-17 15:02:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-17 15:02:48,249 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 9 [2025-03-17 15:02:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,249 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-17 15:02:48,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-17 15:02:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:02:48,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:02:48,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1560674823, now seen corresponding path program 1 times [2025-03-17 15:02:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446631901] [2025-03-17 15:02:48,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:02:48,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:02:48,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446631901] [2025-03-17 15:02:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446631901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:48,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:48,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:02:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628308943] [2025-03-17 15:02:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:48,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:48,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:48,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:48,274 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,302 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-03-17 15:02:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-17 15:02:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,304 INFO L225 Difference]: With dead ends: 38 [2025-03-17 15:02:48,304 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 15:02:48,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:02:48,305 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 23 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-17 15:02:48,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 15:02:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 15:02:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2025-03-17 15:02:48,311 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 10 [2025-03-17 15:02:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,311 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2025-03-17 15:02:48,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2025-03-17 15:02:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:02:48,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:02:48,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -347753126, now seen corresponding path program 1 times [2025-03-17 15:02:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880528387] [2025-03-17 15:02:48,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:02:48,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:02:48,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880528387] [2025-03-17 15:02:48,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880528387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:48,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:48,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:02:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136195532] [2025-03-17 15:02:48,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:02:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:48,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:02:48,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:48,339 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,349 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2025-03-17 15:02:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:02:48,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-17 15:02:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,350 INFO L225 Difference]: With dead ends: 31 [2025-03-17 15:02:48,351 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 15:02:48,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:48,351 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:48,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 15:02:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 15:02:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 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-17 15:02:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-03-17 15:02:48,355 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 10 [2025-03-17 15:02:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,355 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-03-17 15:02:48,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-03-17 15:02:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:02:48,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:02:48,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1134934697, now seen corresponding path program 1 times [2025-03-17 15:02:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205598134] [2025-03-17 15:02:48,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:02:48,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:02:48,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205598134] [2025-03-17 15:02:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205598134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813784081] [2025-03-17 15:02:48,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:48,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:48,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:48,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:02:48,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:02:48,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:02:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:02:48,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813784081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:48,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:48,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 15:02:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737130206] [2025-03-17 15:02:48,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:48,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:02:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:48,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:02:48,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:02:48,511 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-17 15:02:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,563 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-03-17 15:02:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:02:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 14 [2025-03-17 15:02:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,564 INFO L225 Difference]: With dead ends: 74 [2025-03-17 15:02:48,565 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 15:02:48,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:02:48,569 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:48,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 67 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 15:02:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2025-03-17 15:02:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-17 15:02:48,572 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 14 [2025-03-17 15:02:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,572 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-17 15:02:48,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-17 15:02:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-17 15:02:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:02:48,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,573 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:02:48,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 15:02:48,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -823277957, now seen corresponding path program 1 times [2025-03-17 15:02:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507133351] [2025-03-17 15:02:48,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:02:48,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:02:48,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507133351] [2025-03-17 15:02:48,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507133351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:48,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:48,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:02:48,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141305779] [2025-03-17 15:02:48,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:48,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:02:48,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:48,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:02:48,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:02:48,845 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:48,885 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-03-17 15:02:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:02:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 15:02:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:48,886 INFO L225 Difference]: With dead ends: 51 [2025-03-17 15:02:48,886 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 15:02:48,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:02:48,886 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:48,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 37 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 15:02:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 15:02:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 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-17 15:02:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-17 15:02:48,889 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 15 [2025-03-17 15:02:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:48,889 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-17 15:02:48,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-17 15:02:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 15:02:48,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:48,889 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:48,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:02:48,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:48,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash 248187092, now seen corresponding path program 1 times [2025-03-17 15:02:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776647786] [2025-03-17 15:02:48,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:48,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:02:48,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:02:48,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776647786] [2025-03-17 15:02:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776647786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030648442] [2025-03-17 15:02:48,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:48,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:48,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:48,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:48,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:02:48,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:02:48,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:02:48,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:48,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:48,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:02:48,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:49,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030648442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:49,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 15:02:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764118513] [2025-03-17 15:02:49,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:02:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:49,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:02:49,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:02:49,119 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:49,185 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-03-17 15:02:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:02:49,185 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 15:02:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:49,186 INFO L225 Difference]: With dead ends: 62 [2025-03-17 15:02:49,186 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 15:02:49,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:02:49,186 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:49,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 15:02:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2025-03-17 15:02:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-17 15:02:49,189 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 16 [2025-03-17 15:02:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:49,189 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-17 15:02:49,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-17 15:02:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 15:02:49,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:49,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:49,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:02:49,394 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,SelfDestructingSolverStorable12 [2025-03-17 15:02:49,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 249449237, now seen corresponding path program 1 times [2025-03-17 15:02:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642725851] [2025-03-17 15:02:49,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:49,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:02:49,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:02:49,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642725851] [2025-03-17 15:02:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642725851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065346440] [2025-03-17 15:02:49,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:49,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:49,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:49,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:49,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:02:49,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:02:49,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:02:49,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:49,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:49,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:02:49,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:49,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065346440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:49,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 15:02:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137553009] [2025-03-17 15:02:49,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:49,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:02:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:49,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:02:49,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:02:49,522 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:49,565 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2025-03-17 15:02:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:02:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 16 [2025-03-17 15:02:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:49,565 INFO L225 Difference]: With dead ends: 73 [2025-03-17 15:02:49,565 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 15:02:49,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:02:49,566 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:49,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 68 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 15:02:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2025-03-17 15:02:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.22) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-17 15:02:49,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2025-03-17 15:02:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:49,573 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-17 15:02:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-17 15:02:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 15:02:49,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:49,573 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:49,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:49,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:49,774 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -896134759, now seen corresponding path program 1 times [2025-03-17 15:02:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070566133] [2025-03-17 15:02:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:49,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:02:49,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:02:49,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:49,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:49,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070566133] [2025-03-17 15:02:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070566133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676815165] [2025-03-17 15:02:49,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:49,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:49,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:49,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:02:49,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:02:49,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:02:49,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:49,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:02:49,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:49,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:02:50,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676815165] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:50,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:02:50,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 16 [2025-03-17 15:02:50,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402758286] [2025-03-17 15:02:50,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:50,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:02:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:50,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:02:50,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:02:50,056 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:50,089 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-17 15:02:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:02:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 17 [2025-03-17 15:02:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:50,089 INFO L225 Difference]: With dead ends: 56 [2025-03-17 15:02:50,089 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 15:02:50,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:02:50,090 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:50,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 15:02:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 15:02:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-03-17 15:02:50,093 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2025-03-17 15:02:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:50,093 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-03-17 15:02:50,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-03-17 15:02:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 15:02:50,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:50,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:02:50,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:02:50,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:02:50,298 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:50,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash -857008253, now seen corresponding path program 1 times [2025-03-17 15:02:50,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:50,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880988434] [2025-03-17 15:02:50,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:50,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:02:50,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:02:50,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:50,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:50,321 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-17 15:02:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880988434] [2025-03-17 15:02:50,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880988434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27854441] [2025-03-17 15:02:50,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:50,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:50,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:50,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:50,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:02:50,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:02:50,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:02:50,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:50,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:50,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:02:50,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:50,368 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-17 15:02:50,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:50,395 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-17 15:02:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27854441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:50,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 15:02:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114033973] [2025-03-17 15:02:50,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:02:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:50,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:02:50,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:02:50,396 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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-17 15:02:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:50,416 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2025-03-17 15:02:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:02:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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) Word has length 17 [2025-03-17 15:02:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:50,417 INFO L225 Difference]: With dead ends: 72 [2025-03-17 15:02:50,417 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 15:02:50,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-17 15:02:50,417 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:50,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 15:02:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 56. [2025-03-17 15:02:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-03-17 15:02:50,421 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 17 [2025-03-17 15:02:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-03-17 15:02:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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-17 15:02:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-03-17 15:02:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 15:02:50,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:50,422 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:50,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:50,622 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,SelfDestructingSolverStorable15 [2025-03-17 15:02:50,623 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2010373774, now seen corresponding path program 1 times [2025-03-17 15:02:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389907984] [2025-03-17 15:02:50,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:50,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:02:50,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:02:50,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:50,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:02:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389907984] [2025-03-17 15:02:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389907984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:50,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:02:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789816398] [2025-03-17 15:02:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:50,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:02:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:50,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:02:50,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:02:50,676 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:50,706 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2025-03-17 15:02:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:02:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 15:02:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:50,707 INFO L225 Difference]: With dead ends: 56 [2025-03-17 15:02:50,707 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 15:02:50,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:02:50,707 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:50,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 15:02:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 15:02:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-03-17 15:02:50,710 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 18 [2025-03-17 15:02:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:50,710 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-03-17 15:02:50,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-03-17 15:02:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 15:02:50,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:50,714 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 15:02:50,714 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:50,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1621685946, now seen corresponding path program 2 times [2025-03-17 15:02:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476166125] [2025-03-17 15:02:50,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:50,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 15:02:50,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 15:02:50,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:50,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476166125] [2025-03-17 15:02:50,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476166125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098888425] [2025-03-17 15:02:50,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:50,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:50,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:50,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:50,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:02:50,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 15:02:50,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 15:02:50,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:50,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:50,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 15:02:50,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:51,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098888425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:51,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-17 15:02:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100974836] [2025-03-17 15:02:51,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 15:02:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:51,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 15:02:51,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:02:51,197 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 32 states, 31 states have (on average 3.032258064516129) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:51,347 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2025-03-17 15:02:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 15:02:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.032258064516129) internal successors, (94), 32 states have internal predecessors, (94), 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 32 [2025-03-17 15:02:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:51,348 INFO L225 Difference]: With dead ends: 89 [2025-03-17 15:02:51,348 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 15:02:51,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 15:02:51,349 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:51,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 15:02:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2025-03-17 15:02:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-03-17 15:02:51,353 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 32 [2025-03-17 15:02:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:51,353 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-03-17 15:02:51,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.032258064516129) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-03-17 15:02:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 15:02:51,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:51,356 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-17 15:02:51,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:51,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:02:51,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash 847144770, now seen corresponding path program 2 times [2025-03-17 15:02:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902179079] [2025-03-17 15:02:51,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:51,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 15:02:51,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:02:51,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902179079] [2025-03-17 15:02:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902179079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936995253] [2025-03-17 15:02:51,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:51,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:51,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:51,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:51,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:02:51,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 15:02:51,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:02:51,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:51,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:02:51,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:51,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936995253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:51,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:51,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-17 15:02:51,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939680959] [2025-03-17 15:02:51,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:51,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:02:51,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:51,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:02:51,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:02:51,922 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:51,973 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2025-03-17 15:02:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 15:02:51,973 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 22 states have internal predecessors, (75), 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 38 [2025-03-17 15:02:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:51,974 INFO L225 Difference]: With dead ends: 117 [2025-03-17 15:02:51,974 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 15:02:51,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:02:51,975 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:51,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 109 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 15:02:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2025-03-17 15:02:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-03-17 15:02:51,979 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 38 [2025-03-17 15:02:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-03-17 15:02:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-03-17 15:02:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 15:02:51,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:51,979 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2025-03-17 15:02:51,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:02:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:52,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:52,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1937662400, now seen corresponding path program 2 times [2025-03-17 15:02:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634742881] [2025-03-17 15:02:52,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:52,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 15:02:52,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:02:52,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:52,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634742881] [2025-03-17 15:02:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634742881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703742350] [2025-03-17 15:02:52,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:52,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:52,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:52,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:52,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:02:52,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 15:02:52,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:02:52,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:52,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:52,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:02:52,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:52,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703742350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:52,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-17 15:02:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171561676] [2025-03-17 15:02:52,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:52,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:02:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:52,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:02:52,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:02:52,528 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:52,584 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2025-03-17 15:02:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 15:02:52,585 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 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 40 [2025-03-17 15:02:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:52,586 INFO L225 Difference]: With dead ends: 114 [2025-03-17 15:02:52,586 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 15:02:52,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:02:52,587 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:52,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 15:02:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2025-03-17 15:02:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.1304347826086956) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2025-03-17 15:02:52,594 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 40 [2025-03-17 15:02:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:52,595 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2025-03-17 15:02:52,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2025-03-17 15:02:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 15:02:52,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:52,596 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2025-03-17 15:02:52,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:52,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:52,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 62007736, now seen corresponding path program 2 times [2025-03-17 15:02:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262045312] [2025-03-17 15:02:52,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:52,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 15:02:52,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:02:52,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:52,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:52,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262045312] [2025-03-17 15:02:52,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262045312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:52,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028414830] [2025-03-17 15:02:52,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:52,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:52,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:52,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:52,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:02:52,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 15:02:52,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:02:52,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:52,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:52,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:02:52,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:52,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:53,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028414830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:53,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:53,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 15:02:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506966567] [2025-03-17 15:02:53,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:53,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:02:53,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:53,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:02:53,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:02:53,066 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:53,091 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2025-03-17 15:02:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:02:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 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-17 15:02:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:53,092 INFO L225 Difference]: With dead ends: 113 [2025-03-17 15:02:53,092 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 15:02:53,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 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-17 15:02:53,092 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:53,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 15:02:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2025-03-17 15:02:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.075268817204301) internal successors, (100), 96 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2025-03-17 15:02:53,097 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 41 [2025-03-17 15:02:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:53,097 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2025-03-17 15:02:53,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2025-03-17 15:02:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 15:02:53,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:53,098 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:53,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:02:53,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:53,299 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:53,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash -299524566, now seen corresponding path program 3 times [2025-03-17 15:02:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:53,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296928748] [2025-03-17 15:02:53,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:53,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 8 equivalence classes. [2025-03-17 15:02:53,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:02:53,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 15:02:53,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:53,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:53,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296928748] [2025-03-17 15:02:53,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296928748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:53,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598521245] [2025-03-17 15:02:53,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:53,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:53,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:53,582 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-17 15:02:53,584 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-17 15:02:53,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 8 equivalence classes. [2025-03-17 15:02:53,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:02:53,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 15:02:53,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:53,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 15:02:53,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:54,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598521245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:54,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:54,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 63 [2025-03-17 15:02:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958656738] [2025-03-17 15:02:54,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-17 15:02:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:54,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-17 15:02:54,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=3421, Unknown=0, NotChecked=0, Total=4032 [2025-03-17 15:02:54,466 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 64 states, 63 states have (on average 3.015873015873016) internal successors, (190), 64 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:54,702 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2025-03-17 15:02:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 15:02:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.015873015873016) internal successors, (190), 64 states have internal predecessors, (190), 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 64 [2025-03-17 15:02:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:54,703 INFO L225 Difference]: With dead ends: 171 [2025-03-17 15:02:54,703 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 15:02:54,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=673, Invalid=3749, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 15:02:54,705 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 60 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:54,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 169 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:02:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 15:02:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2025-03-17 15:02:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.125) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2025-03-17 15:02:54,714 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 64 [2025-03-17 15:02:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:54,714 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2025-03-17 15:02:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.015873015873016) internal successors, (190), 64 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2025-03-17 15:02:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 15:02:54,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:54,715 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2025-03-17 15:02:54,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:54,915 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,SelfDestructingSolverStorable21 [2025-03-17 15:02:54,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:54,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2100607000, now seen corresponding path program 3 times [2025-03-17 15:02:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844682623] [2025-03-17 15:02:54,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:54,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 11 equivalence classes. [2025-03-17 15:02:54,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 15:02:54,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:54,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844682623] [2025-03-17 15:02:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844682623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155236911] [2025-03-17 15:02:55,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:55,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:55,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:55,326 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-17 15:02:55,328 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-17 15:02:55,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 11 equivalence classes. [2025-03-17 15:02:55,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 15:02:55,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:55,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:55,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:02:55,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:55,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155236911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:55,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-03-17 15:02:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929048248] [2025-03-17 15:02:55,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:55,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 15:02:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:55,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 15:02:55,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 15:02:55,906 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 46 states, 45 states have (on average 3.8) internal successors, (171), 46 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-17 15:02:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:55,998 INFO L93 Difference]: Finished difference Result 241 states and 259 transitions. [2025-03-17 15:02:55,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 15:02:55,998 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.8) internal successors, (171), 46 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) Word has length 86 [2025-03-17 15:02:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:55,999 INFO L225 Difference]: With dead ends: 241 [2025-03-17 15:02:55,999 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 15:02:56,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 15:02:56,000 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:56,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 15:02:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 190. [2025-03-17 15:02:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 186 states have (on average 1.1774193548387097) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2025-03-17 15:02:56,006 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 86 [2025-03-17 15:02:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:56,006 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2025-03-17 15:02:56,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.8) internal successors, (171), 46 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-17 15:02:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2025-03-17 15:02:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 15:02:56,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:56,007 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1] [2025-03-17 15:02:56,013 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-17 15:02:56,207 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,SelfDestructingSolverStorable22 [2025-03-17 15:02:56,208 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:56,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash 48697750, now seen corresponding path program 3 times [2025-03-17 15:02:56,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:56,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-17 15:02:56,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:56,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 11 equivalence classes. [2025-03-17 15:02:56,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 15:02:56,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:56,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:56,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-17 15:02:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466950015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182036738] [2025-03-17 15:02:56,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:56,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:56,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:56,577 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-17 15:02:56,578 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-17 15:02:56,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 11 equivalence classes. [2025-03-17 15:02:56,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 15:02:56,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:56,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:56,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 15:02:56,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:56,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182036738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:57,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:57,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-03-17 15:02:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414692632] [2025-03-17 15:02:57,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 15:02:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 15:02:57,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 15:02:57,083 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 46 states, 45 states have (on average 3.888888888888889) internal successors, (175), 46 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:57,175 INFO L93 Difference]: Finished difference Result 232 states and 250 transitions. [2025-03-17 15:02:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 15:02:57,176 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.888888888888889) internal successors, (175), 46 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-17 15:02:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:57,177 INFO L225 Difference]: With dead ends: 232 [2025-03-17 15:02:57,177 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 15:02:57,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 15:02:57,178 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:57,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 213 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 15:02:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2025-03-17 15:02:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 188 states have (on average 1.1170212765957446) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2025-03-17 15:02:57,186 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 88 [2025-03-17 15:02:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:57,186 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2025-03-17 15:02:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.888888888888889) internal successors, (175), 46 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2025-03-17 15:02:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 15:02:57,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:57,189 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1] [2025-03-17 15:02:57,195 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-17 15:02:57,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 15:02:57,393 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:57,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1509630242, now seen corresponding path program 3 times [2025-03-17 15:02:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973035749] [2025-03-17 15:02:57,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:57,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 11 equivalence classes. [2025-03-17 15:02:57,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:02:57,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:57,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:57,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973035749] [2025-03-17 15:02:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973035749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162665499] [2025-03-17 15:02:57,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:57,567 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-17 15:02:57,569 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-17 15:02:57,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 11 equivalence classes. [2025-03-17 15:02:57,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 15:02:57,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:57,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:57,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:02:57,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:57,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162665499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:57,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-17 15:02:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312458560] [2025-03-17 15:02:57,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:57,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 15:02:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:57,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 15:02:57,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:02:57,946 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 24 states, 23 states have (on average 7.695652173913044) internal successors, (177), 24 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:58,001 INFO L93 Difference]: Finished difference Result 229 states and 240 transitions. [2025-03-17 15:02:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:02:58,002 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.695652173913044) internal successors, (177), 24 states have internal predecessors, (177), 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 89 [2025-03-17 15:02:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:58,003 INFO L225 Difference]: With dead ends: 229 [2025-03-17 15:02:58,003 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 15:02:58,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 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-17 15:02:58,003 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 107 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:58,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 226 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 15:02:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 193. [2025-03-17 15:02:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 189 states have (on average 1.0582010582010581) internal successors, (200), 192 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 200 transitions. [2025-03-17 15:02:58,010 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 200 transitions. Word has length 89 [2025-03-17 15:02:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:58,010 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 200 transitions. [2025-03-17 15:02:58,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.695652173913044) internal successors, (177), 24 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 200 transitions. [2025-03-17 15:02:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 15:02:58,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:58,015 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:58,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:58,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 15:02:58,216 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:02:58,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash 545069042, now seen corresponding path program 4 times [2025-03-17 15:02:58,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:58,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087553160] [2025-03-17 15:02:58,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:02:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:58,222 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-03-17 15:02:58,235 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 15:02:58,239 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:02:58,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087553160] [2025-03-17 15:02:58,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087553160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682809729] [2025-03-17 15:02:58,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:02:58,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:58,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:58,775 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:58,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 15:02:58,798 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-03-17 15:02:58,820 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 15:02:58,820 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:02:58,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:58,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-17 15:02:58,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:59,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:00,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682809729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:00,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:00,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 47, 47] total 127 [2025-03-17 15:03:00,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274935796] [2025-03-17 15:03:00,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:00,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-17 15:03:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:00,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-17 15:03:01,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2302, Invalid=13954, Unknown=0, NotChecked=0, Total=16256 [2025-03-17 15:03:01,001 INFO L87 Difference]: Start difference. First operand 193 states and 200 transitions. Second operand has 128 states, 127 states have (on average 3.0078740157480315) internal successors, (382), 128 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:01,373 INFO L93 Difference]: Finished difference Result 335 states and 364 transitions. [2025-03-17 15:03:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-17 15:03:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 3.0078740157480315) internal successors, (382), 128 states have internal predecessors, (382), 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 128 [2025-03-17 15:03:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:01,374 INFO L225 Difference]: With dead ends: 335 [2025-03-17 15:03:01,374 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 15:03:01,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10127 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2412, Invalid=14618, Unknown=0, NotChecked=0, Total=17030 [2025-03-17 15:03:01,378 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 162 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:01,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 251 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:03:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 15:03:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2025-03-17 15:03:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 256 states have (on average 1.109375) internal successors, (284), 259 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 284 transitions. [2025-03-17 15:03:01,387 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 284 transitions. Word has length 128 [2025-03-17 15:03:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:01,387 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 284 transitions. [2025-03-17 15:03:01,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 3.0078740157480315) internal successors, (382), 128 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 284 transitions. [2025-03-17 15:03:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 15:03:01,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:01,388 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1] [2025-03-17 15:03:01,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 15:03:01,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:01,591 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:01,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1194167748, now seen corresponding path program 4 times [2025-03-17 15:03:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996726633] [2025-03-17 15:03:01,591 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:03:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:01,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 182 statements into 2 equivalence classes. [2025-03-17 15:03:01,623 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 15:03:01,623 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:03:01,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996726633] [2025-03-17 15:03:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996726633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638776566] [2025-03-17 15:03:02,563 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:03:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:02,565 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:02,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 15:03:02,593 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 182 statements into 2 equivalence classes. [2025-03-17 15:03:02,627 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 15:03:02,627 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:03:02,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:02,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 15:03:02,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:02,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638776566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:04,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-17 15:03:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933114644] [2025-03-17 15:03:04,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-03-17 15:03:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:04,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-03-17 15:03:04,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2025-03-17 15:03:04,053 INFO L87 Difference]: Start difference. First operand 260 states and 284 transitions. Second operand has 95 states, 94 states have (on average 3.893617021276596) internal successors, (366), 95 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:04,273 INFO L93 Difference]: Finished difference Result 489 states and 527 transitions. [2025-03-17 15:03:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-17 15:03:04,274 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 94 states have (on average 3.893617021276596) internal successors, (366), 95 states have internal predecessors, (366), 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 182 [2025-03-17 15:03:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:04,275 INFO L225 Difference]: With dead ends: 489 [2025-03-17 15:03:04,275 INFO L226 Difference]: Without dead ends: 488 [2025-03-17 15:03:04,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2665 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2025-03-17 15:03:04,276 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:04,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 370 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:03:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-17 15:03:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 382. [2025-03-17 15:03:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 378 states have (on average 1.1719576719576719) internal successors, (443), 381 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 443 transitions. [2025-03-17 15:03:04,291 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 443 transitions. Word has length 182 [2025-03-17 15:03:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:04,291 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 443 transitions. [2025-03-17 15:03:04,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 94 states have (on average 3.893617021276596) internal successors, (366), 95 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 443 transitions. [2025-03-17 15:03:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 15:03:04,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:04,292 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1] [2025-03-17 15:03:04,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 15:03:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 15:03:04,493 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:04,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash 838937666, now seen corresponding path program 4 times [2025-03-17 15:03:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:04,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-03-17 15:03:04,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:03:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:04,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 184 statements into 2 equivalence classes. [2025-03-17 15:03:04,524 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 15:03:04,524 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:03:04,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:05,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:05,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-03-17 15:03:05,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428772396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:05,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943499281] [2025-03-17 15:03:05,527 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:03:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:05,529 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:05,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 15:03:05,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 184 statements into 2 equivalence classes. [2025-03-17 15:03:05,616 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 15:03:05,616 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:03:05,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:05,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 15:03:05,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:05,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:07,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943499281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:07,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:07,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2025-03-17 15:03:07,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890222906] [2025-03-17 15:03:07,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:07,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-03-17 15:03:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:07,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-03-17 15:03:07,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2025-03-17 15:03:07,096 INFO L87 Difference]: Start difference. First operand 382 states and 443 transitions. Second operand has 95 states, 94 states have (on average 3.9361702127659575) internal successors, (370), 95 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:07,308 INFO L93 Difference]: Finished difference Result 468 states and 506 transitions. [2025-03-17 15:03:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-17 15:03:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 94 states have (on average 3.9361702127659575) internal successors, (370), 95 states have internal predecessors, (370), 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 184 [2025-03-17 15:03:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:07,311 INFO L225 Difference]: With dead ends: 468 [2025-03-17 15:03:07,311 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 15:03:07,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2025-03-17 15:03:07,313 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 351 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:07,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 334 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:03:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 15:03:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 384. [2025-03-17 15:03:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 380 states have (on average 1.1105263157894736) internal successors, (422), 383 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 422 transitions. [2025-03-17 15:03:07,322 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 422 transitions. Word has length 184 [2025-03-17 15:03:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:07,323 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 422 transitions. [2025-03-17 15:03:07,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 94 states have (on average 3.9361702127659575) internal successors, (370), 95 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 422 transitions. [2025-03-17 15:03:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 15:03:07,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:07,324 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1] [2025-03-17 15:03:07,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 15:03:07,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 15:03:07,528 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:07,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash 237263862, now seen corresponding path program 4 times [2025-03-17 15:03:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:07,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800624447] [2025-03-17 15:03:07,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:03:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:07,534 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 185 statements into 2 equivalence classes. [2025-03-17 15:03:07,546 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 15:03:07,546 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:03:07,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800624447] [2025-03-17 15:03:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800624447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687963097] [2025-03-17 15:03:07,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:03:07,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:07,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:07,933 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:07,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 15:03:07,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 185 statements into 2 equivalence classes. [2025-03-17 15:03:07,996 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 15:03:07,996 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:03:07,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:07,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:03:08,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:08,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687963097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:08,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:08,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-17 15:03:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487822235] [2025-03-17 15:03:08,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:08,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 15:03:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:08,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 15:03:08,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:03:08,721 INFO L87 Difference]: Start difference. First operand 384 states and 422 transitions. Second operand has 48 states, 47 states have (on average 7.851063829787234) internal successors, (369), 48 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:08,821 INFO L93 Difference]: Finished difference Result 461 states and 484 transitions. [2025-03-17 15:03:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 15:03:08,822 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 7.851063829787234) internal successors, (369), 48 states have internal predecessors, (369), 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 185 [2025-03-17 15:03:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:08,823 INFO L225 Difference]: With dead ends: 461 [2025-03-17 15:03:08,823 INFO L226 Difference]: Without dead ends: 460 [2025-03-17 15:03:08,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 346 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-17 15:03:08,824 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 217 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:08,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 388 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:03:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-17 15:03:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 385. [2025-03-17 15:03:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 381 states have (on average 1.0498687664041995) internal successors, (400), 384 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 400 transitions. [2025-03-17 15:03:08,840 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 400 transitions. Word has length 185 [2025-03-17 15:03:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:08,840 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 400 transitions. [2025-03-17 15:03:08,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.851063829787234) internal successors, (369), 48 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 400 transitions. [2025-03-17 15:03:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-17 15:03:08,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:08,842 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:03:08,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 15:03:09,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 15:03:09,042 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:09,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1192577922, now seen corresponding path program 5 times [2025-03-17 15:03:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:09,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387173350] [2025-03-17 15:03:09,043 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:09,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:09,050 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 256 statements into 32 equivalence classes. [2025-03-17 15:03:09,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 15:03:09,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-17 15:03:09,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:10,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387173350] [2025-03-17 15:03:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387173350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693933147] [2025-03-17 15:03:10,787 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:10,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:10,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:10,788 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:10,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 15:03:10,820 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 256 statements into 32 equivalence classes. [2025-03-17 15:03:10,901 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 15:03:10,901 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-17 15:03:10,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:10,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-17 15:03:10,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:13,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693933147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:16,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:16,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 95, 95] total 254 [2025-03-17 15:03:16,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950715499] [2025-03-17 15:03:16,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:16,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 255 states [2025-03-17 15:03:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:16,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 255 interpolants. [2025-03-17 15:03:16,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8914, Invalid=55856, Unknown=0, NotChecked=0, Total=64770 [2025-03-17 15:03:16,792 INFO L87 Difference]: Start difference. First operand 385 states and 400 transitions. Second operand has 255 states, 254 states have (on average 3.015748031496063) internal successors, (766), 255 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:17,381 INFO L93 Difference]: Finished difference Result 662 states and 724 transitions. [2025-03-17 15:03:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-03-17 15:03:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 255 states, 254 states have (on average 3.015748031496063) internal successors, (766), 255 states have internal predecessors, (766), 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 256 [2025-03-17 15:03:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:17,383 INFO L225 Difference]: With dead ends: 662 [2025-03-17 15:03:17,383 INFO L226 Difference]: Without dead ends: 533 [2025-03-17 15:03:17,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42687 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8979, Invalid=56301, Unknown=0, NotChecked=0, Total=65280 [2025-03-17 15:03:17,387 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 446 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:17,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 390 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:03:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-17 15:03:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 516. [2025-03-17 15:03:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 512 states have (on average 1.1015625) internal successors, (564), 515 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 564 transitions. [2025-03-17 15:03:17,399 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 564 transitions. Word has length 256 [2025-03-17 15:03:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:17,399 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 564 transitions. [2025-03-17 15:03:17,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 255 states, 254 states have (on average 3.015748031496063) internal successors, (766), 255 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 564 transitions. [2025-03-17 15:03:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-17 15:03:17,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:17,402 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1] [2025-03-17 15:03:17,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 15:03:17,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:17,603 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:17,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2079328540, now seen corresponding path program 5 times [2025-03-17 15:03:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:17,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834279242] [2025-03-17 15:03:17,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:17,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:17,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 374 statements into 47 equivalence classes. [2025-03-17 15:03:17,712 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 374 of 374 statements. [2025-03-17 15:03:17,713 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:03:17,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834279242] [2025-03-17 15:03:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834279242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708352860] [2025-03-17 15:03:20,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:20,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:20,971 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:20,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 15:03:21,010 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 374 statements into 47 equivalence classes. [2025-03-17 15:03:21,159 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 374 of 374 statements. [2025-03-17 15:03:21,159 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:03:21,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:21,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 15:03:21,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:21,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708352860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:26,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-03-17 15:03:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536229279] [2025-03-17 15:03:26,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-03-17 15:03:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-03-17 15:03:26,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-17 15:03:26,189 INFO L87 Difference]: Start difference. First operand 516 states and 564 transitions. Second operand has 190 states, 189 states have (on average 3.9523809523809526) internal successors, (747), 190 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:26,823 INFO L93 Difference]: Finished difference Result 985 states and 1063 transitions. [2025-03-17 15:03:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-03-17 15:03:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 3.9523809523809526) internal successors, (747), 190 states have internal predecessors, (747), 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 374 [2025-03-17 15:03:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:26,826 INFO L225 Difference]: With dead ends: 985 [2025-03-17 15:03:26,826 INFO L226 Difference]: Without dead ends: 984 [2025-03-17 15:03:26,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-17 15:03:26,828 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 654 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:26,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 717 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:03:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-03-17 15:03:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 766. [2025-03-17 15:03:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 762 states have (on average 1.169291338582677) internal successors, (891), 765 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 891 transitions. [2025-03-17 15:03:26,844 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 891 transitions. Word has length 374 [2025-03-17 15:03:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:26,844 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 891 transitions. [2025-03-17 15:03:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 3.9523809523809526) internal successors, (747), 190 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 891 transitions. [2025-03-17 15:03:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-17 15:03:26,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:26,847 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 46, 46, 46, 1, 1, 1] [2025-03-17 15:03:26,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-17 15:03:27,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:27,049 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:27,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:27,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1074934170, now seen corresponding path program 5 times [2025-03-17 15:03:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:27,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070875603] [2025-03-17 15:03:27,049 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:27,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 47 equivalence classes. [2025-03-17 15:03:27,147 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 376 of 376 statements. [2025-03-17 15:03:27,147 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:03:27,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:30,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070875603] [2025-03-17 15:03:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070875603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106096221] [2025-03-17 15:03:30,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:30,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:30,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:30,189 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:30,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 15:03:30,229 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 376 statements into 47 equivalence classes. [2025-03-17 15:03:30,390 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 376 of 376 statements. [2025-03-17 15:03:30,390 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:03:30,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:30,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-17 15:03:30,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:30,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106096221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:35,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-03-17 15:03:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109974537] [2025-03-17 15:03:35,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:35,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-03-17 15:03:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:35,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-03-17 15:03:35,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-17 15:03:35,301 INFO L87 Difference]: Start difference. First operand 766 states and 891 transitions. Second operand has 190 states, 189 states have (on average 3.9735449735449735) internal successors, (751), 190 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:35,827 INFO L93 Difference]: Finished difference Result 940 states and 1018 transitions. [2025-03-17 15:03:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-03-17 15:03:35,828 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 3.9735449735449735) internal successors, (751), 190 states have internal predecessors, (751), 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 376 [2025-03-17 15:03:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:35,830 INFO L225 Difference]: With dead ends: 940 [2025-03-17 15:03:35,830 INFO L226 Difference]: Without dead ends: 939 [2025-03-17 15:03:35,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-17 15:03:35,832 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 439 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:35,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 642 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:03:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-17 15:03:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 768. [2025-03-17 15:03:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 764 states have (on average 1.1073298429319371) internal successors, (846), 767 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 846 transitions. [2025-03-17 15:03:35,850 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 846 transitions. Word has length 376 [2025-03-17 15:03:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:35,850 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 846 transitions. [2025-03-17 15:03:35,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 3.9735449735449735) internal successors, (751), 190 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 846 transitions. [2025-03-17 15:03:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-17 15:03:35,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:35,852 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1] [2025-03-17 15:03:35,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-17 15:03:36,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 15:03:36,053 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:36,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1036779106, now seen corresponding path program 5 times [2025-03-17 15:03:36,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:36,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388213965] [2025-03-17 15:03:36,053 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:36,061 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 377 statements into 47 equivalence classes. [2025-03-17 15:03:36,123 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 377 of 377 statements. [2025-03-17 15:03:36,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:03:36,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8602 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388213965] [2025-03-17 15:03:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388213965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052394290] [2025-03-17 15:03:37,262 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:03:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:37,264 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:37,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 15:03:37,305 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 377 statements into 47 equivalence classes. [2025-03-17 15:03:37,486 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 377 of 377 statements. [2025-03-17 15:03:37,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:03:37,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:37,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 15:03:37,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8602 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:37,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:03:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8602 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:39,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052394290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:03:39,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:03:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-17 15:03:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379614838] [2025-03-17 15:03:39,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:03:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-17 15:03:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:39,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 15:03:39,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 15:03:39,738 INFO L87 Difference]: Start difference. First operand 768 states and 846 transitions. Second operand has 96 states, 95 states have (on average 7.926315789473684) internal successors, (753), 96 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:40,076 INFO L93 Difference]: Finished difference Result 925 states and 972 transitions. [2025-03-17 15:03:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 15:03:40,080 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 7.926315789473684) internal successors, (753), 96 states have internal predecessors, (753), 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 377 [2025-03-17 15:03:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:40,082 INFO L225 Difference]: With dead ends: 925 [2025-03-17 15:03:40,082 INFO L226 Difference]: Without dead ends: 924 [2025-03-17 15:03:40,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 706 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-17 15:03:40,083 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 402 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:40,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 770 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:03:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-17 15:03:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 769. [2025-03-17 15:03:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 765 states have (on average 1.0457516339869282) internal successors, (800), 768 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 800 transitions. [2025-03-17 15:03:40,111 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 800 transitions. Word has length 377 [2025-03-17 15:03:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:40,112 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 800 transitions. [2025-03-17 15:03:40,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 7.926315789473684) internal successors, (753), 96 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 800 transitions. [2025-03-17 15:03:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-17 15:03:40,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:03:40,116 INFO L218 NwaCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:03:40,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-17 15:03:40,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-17 15:03:40,318 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:03:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:03:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash 334148258, now seen corresponding path program 6 times [2025-03-17 15:03:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:03:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720209007] [2025-03-17 15:03:40,319 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:03:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:03:40,336 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 512 statements into 64 equivalence classes. [2025-03-17 15:03:40,549 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 512 of 512 statements. [2025-03-17 15:03:40,550 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-03-17 15:03:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:03:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720209007] [2025-03-17 15:03:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720209007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:03:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952894084] [2025-03-17 15:03:46,676 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:03:46,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:46,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:03:46,679 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:03:46,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 15:03:46,731 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 512 statements into 64 equivalence classes. [2025-03-17 15:03:47,033 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) and asserted 512 of 512 statements. [2025-03-17 15:03:47,033 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2025-03-17 15:03:47,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:03:47,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 255 conjuncts are in the unsatisfiable core [2025-03-17 15:03:47,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:03:54,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:04:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:04:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952894084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:04:08,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:04:08,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 191, 191] total 511 [2025-03-17 15:04:08,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235247854] [2025-03-17 15:04:08,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:04:08,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 512 states [2025-03-17 15:04:08,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:04:08,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 512 interpolants. [2025-03-17 15:04:08,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35303, Invalid=226329, Unknown=0, NotChecked=0, Total=261632 [2025-03-17 15:04:08,723 INFO L87 Difference]: Start difference. First operand 769 states and 800 transitions. Second operand has 512 states, 511 states have (on average 3.0019569471624266) internal successors, (1534), 512 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:04:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:04:11,041 INFO L93 Difference]: Finished difference Result 1319 states and 1444 transitions. [2025-03-17 15:04:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 385 states. [2025-03-17 15:04:11,041 INFO L78 Accepts]: Start accepts. Automaton has has 512 states, 511 states have (on average 3.0019569471624266) internal successors, (1534), 512 states have internal predecessors, (1534), 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 512 [2025-03-17 15:04:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:04:11,044 INFO L225 Difference]: With dead ends: 1319 [2025-03-17 15:04:11,044 INFO L226 Difference]: Without dead ends: 1062 [2025-03-17 15:04:11,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 513 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172563 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=35701, Invalid=229009, Unknown=0, NotChecked=0, Total=264710 [2025-03-17 15:04:11,051 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1129 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:04:11,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 771 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:04:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-03-17 15:04:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1028. [2025-03-17 15:04:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1024 states have (on average 1.09765625) internal successors, (1124), 1027 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:04:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1124 transitions. [2025-03-17 15:04:11,073 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1124 transitions. Word has length 512 [2025-03-17 15:04:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:04:11,074 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1124 transitions. [2025-03-17 15:04:11,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 512 states, 511 states have (on average 3.0019569471624266) internal successors, (1534), 512 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:04:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1124 transitions. [2025-03-17 15:04:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2025-03-17 15:04:11,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:04:11,077 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 94, 94, 94, 94, 94, 1, 1, 1] [2025-03-17 15:04:11,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 15:04:11,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:04:11,278 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:04:11,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:04:11,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1572356044, now seen corresponding path program 6 times [2025-03-17 15:04:11,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:04:11,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65997744] [2025-03-17 15:04:11,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:04:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:04:11,293 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 758 statements into 95 equivalence classes. [2025-03-17 15:04:11,548 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 758 of 758 statements. [2025-03-17 15:04:11,548 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 15:04:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat