./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/egcd3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/nla-digbench/egcd3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb88ed9682db6491f425c1562db72fd328b6ec1826a177590c091d79b16175c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:47:43,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:47:43,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:47:43,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:47:43,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:47:43,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:47:43,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:47:43,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:47:43,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:47:43,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:47:43,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:47:43,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:47:43,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:47:43,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:47:43,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:47:43,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:47:43,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:47:43,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:47:43,450 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 -> bb88ed9682db6491f425c1562db72fd328b6ec1826a177590c091d79b16175c0 [2025-03-04 10:47:43,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:47:43,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:47:43,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:47:43,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:47:43,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:47:43,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/egcd3.c [2025-03-04 10:47:44,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5279e73e3/375fe69a15c14689b7408d1c8cb4bf29/FLAG0c0cd0446 [2025-03-04 10:47:44,943 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:47:44,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/egcd3.c [2025-03-04 10:47:44,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5279e73e3/375fe69a15c14689b7408d1c8cb4bf29/FLAG0c0cd0446 [2025-03-04 10:47:44,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5279e73e3/375fe69a15c14689b7408d1c8cb4bf29 [2025-03-04 10:47:44,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:47:44,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:47:44,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:47:44,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:47:44,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:47:44,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:47:44" (1/1) ... [2025-03-04 10:47:44,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a8b16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:44, skipping insertion in model container [2025-03-04 10:47:44,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:47:44" (1/1) ... [2025-03-04 10:47:44,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:47:45,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:47:45,115 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:47:45,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:47:45,146 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:47:45,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45 WrapperNode [2025-03-04 10:47:45,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:47:45,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:47:45,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:47:45,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:47:45,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,182 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 136 [2025-03-04 10:47:45,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:47:45,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:47:45,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:47:45,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:47:45,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,210 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-04 10:47:45,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:47:45,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:47:45,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:47:45,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:47:45,223 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (1/1) ... [2025-03-04 10:47:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:47:45,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:45,255 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-04 10:47:45,258 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-04 10:47:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:47:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 10:47:45,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 10:47:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:47:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:47:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:47:45,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:47:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:47:45,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:47:45,322 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:47:45,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:47:45,634 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-04 10:47:45,634 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:47:45,641 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:47:45,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:47:45,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:45 BoogieIcfgContainer [2025-03-04 10:47:45,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:47:45,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:47:45,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:47:45,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:47:45,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:47:44" (1/3) ... [2025-03-04 10:47:45,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5fe53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:47:45, skipping insertion in model container [2025-03-04 10:47:45,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:47:45" (2/3) ... [2025-03-04 10:47:45,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5fe53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:47:45, skipping insertion in model container [2025-03-04 10:47:45,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:45" (3/3) ... [2025-03-04 10:47:45,649 INFO L128 eAbstractionObserver]: Analyzing ICFG egcd3.c [2025-03-04 10:47:45,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:47:45,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd3.c that has 3 procedures, 128 locations, 1 initial locations, 3 loop locations, and 50 error locations. [2025-03-04 10:47:45,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:47:45,703 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;@5d769802, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:47:45,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 10:47:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 118 states have internal predecessors, (126), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:47:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:47:45,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:45,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:45,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:45,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1021110937, now seen corresponding path program 1 times [2025-03-04 10:47:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904766514] [2025-03-04 10:47:45,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:45,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:47:45,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:47:45,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:45,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:47:45,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904766514] [2025-03-04 10:47:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904766514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120995273] [2025-03-04 10:47:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:45,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:45,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:45,826 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-04 10:47:45,827 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-04 10:47:45,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:47:45,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:47:45,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:45,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 10:47:45,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:47:45,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120995273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:45,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 10:47:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404930821] [2025-03-04 10:47:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:45,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:47:45,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:45,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:47:45,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:47:45,901 INFO L87 Difference]: Start difference. First operand has 128 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 118 states have internal predecessors, (126), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:45,926 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2025-03-04 10:47:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:47:45,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-04 10:47:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:45,932 INFO L225 Difference]: With dead ends: 252 [2025-03-04 10:47:45,933 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 10:47:45,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:47:45,939 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:45,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:47:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 10:47:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 10:47:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 112 states have internal predecessors, (115), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:47:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2025-03-04 10:47:45,976 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 15 [2025-03-04 10:47:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:45,977 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2025-03-04 10:47:45,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2025-03-04 10:47:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:47:45,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:45,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:45,984 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-04 10:47:46,179 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,SelfDestructingSolverStorable0 [2025-03-04 10:47:46,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:46,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1505534151, now seen corresponding path program 1 times [2025-03-04 10:47:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289886567] [2025-03-04 10:47:46,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:46,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:47:46,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:47:46,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:46,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289886567] [2025-03-04 10:47:46,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289886567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:46,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:46,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:47:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260139883] [2025-03-04 10:47:46,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:46,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:47:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:46,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:47:46,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:47:46,326 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:46,529 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2025-03-04 10:47:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:47:46,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-04 10:47:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:46,530 INFO L225 Difference]: With dead ends: 207 [2025-03-04 10:47:46,530 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 10:47:46,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:47:46,531 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 200 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:46,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 307 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 10:47:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2025-03-04 10:47:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.8125) internal successors, (116), 113 states have internal predecessors, (116), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:47:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2025-03-04 10:47:46,546 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 15 [2025-03-04 10:47:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2025-03-04 10:47:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2025-03-04 10:47:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:47:46,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:46,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:46,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:47:46,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:46,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash -573076939, now seen corresponding path program 1 times [2025-03-04 10:47:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500335246] [2025-03-04 10:47:46,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:46,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:47:46,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:47:46,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:46,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960630402] [2025-03-04 10:47:46,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:46,570 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-04 10:47:46,572 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-04 10:47:46,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:47:46,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:47:46,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:46,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:47:46,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:46,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500335246] [2025-03-04 10:47:46,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960630402] [2025-03-04 10:47:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960630402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419065087] [2025-03-04 10:47:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:46,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:46,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:46,626 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:46,688 INFO L93 Difference]: Finished difference Result 191 states and 205 transitions. [2025-03-04 10:47:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:46,689 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-03-04 10:47:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:46,691 INFO L225 Difference]: With dead ends: 191 [2025-03-04 10:47:46,691 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 10:47:46,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-04 10:47:46,692 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 225 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:46,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 225 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 10:47:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2025-03-04 10:47:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 94 states have (on average 1.851063829787234) internal successors, (174), 143 states have internal predecessors, (174), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:47:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2025-03-04 10:47:46,707 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 16 [2025-03-04 10:47:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:46,707 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2025-03-04 10:47:46,707 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2025-03-04 10:47:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:47:46,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:46,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:46,713 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-04 10:47:46,908 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,SelfDestructingSolverStorable2 [2025-03-04 10:47:46,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash -585519722, now seen corresponding path program 1 times [2025-03-04 10:47:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:46,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578566428] [2025-03-04 10:47:46,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:46,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:47:46,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:47:46,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:46,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525553096] [2025-03-04 10:47:46,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:46,929 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-04 10:47:46,931 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-04 10:47:46,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:47:46,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:47:46,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:46,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:46,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:47:46,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:46,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:46,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578566428] [2025-03-04 10:47:46,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:46,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525553096] [2025-03-04 10:47:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525553096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088843724] [2025-03-04 10:47:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:46,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:46,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:46,974 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:47,056 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2025-03-04 10:47:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:47,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-03-04 10:47:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:47,058 INFO L225 Difference]: With dead ends: 187 [2025-03-04 10:47:47,058 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 10:47:47,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-04 10:47:47,059 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:47,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 207 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 10:47:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 159. [2025-03-04 10:47:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 97 states have (on average 1.8041237113402062) internal successors, (175), 146 states have internal predecessors, (175), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:47:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2025-03-04 10:47:47,073 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 17 [2025-03-04 10:47:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:47,073 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2025-03-04 10:47:47,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2025-03-04 10:47:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:47:47,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:47,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:47,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:47:47,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:47,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash -971122029, now seen corresponding path program 1 times [2025-03-04 10:47:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384898463] [2025-03-04 10:47:47,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:47,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:47,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:47,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151919512] [2025-03-04 10:47:47,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:47,292 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-04 10:47:47,293 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-04 10:47:47,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:47:47,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:47:47,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:47,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:47,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:47,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:47,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:47,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384898463] [2025-03-04 10:47:47,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151919512] [2025-03-04 10:47:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151919512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:47,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994793949] [2025-03-04 10:47:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:47,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:47,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:47,369 INFO L87 Difference]: Start difference. First operand 159 states and 195 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:47,464 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2025-03-04 10:47:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-04 10:47:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:47,466 INFO L225 Difference]: With dead ends: 178 [2025-03-04 10:47:47,466 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 10:47:47,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:47,466 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 136 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:47,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 186 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 10:47:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2025-03-04 10:47:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 97 states have (on average 1.7938144329896908) internal successors, (174), 146 states have internal predecessors, (174), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:47:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 194 transitions. [2025-03-04 10:47:47,474 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 194 transitions. Word has length 18 [2025-03-04 10:47:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:47,474 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 194 transitions. [2025-03-04 10:47:47,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2025-03-04 10:47:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:47:47,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:47,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:47,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:47,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:47,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:47,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash -43736620, now seen corresponding path program 1 times [2025-03-04 10:47:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983946125] [2025-03-04 10:47:47,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:47:47,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:47:47,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983946125] [2025-03-04 10:47:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983946125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:47,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:47:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20454611] [2025-03-04 10:47:47,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:47,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:47:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:47,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:47:47,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:47,763 INFO L87 Difference]: Start difference. First operand 159 states and 194 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:47,964 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2025-03-04 10:47:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:47:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-04 10:47:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:47,966 INFO L225 Difference]: With dead ends: 182 [2025-03-04 10:47:47,966 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 10:47:47,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:47,968 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 52 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:47,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 389 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 10:47:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2025-03-04 10:47:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 98 states have (on average 1.7857142857142858) internal successors, (175), 147 states have internal predecessors, (175), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:47:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2025-03-04 10:47:47,995 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 19 [2025-03-04 10:47:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:47,995 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2025-03-04 10:47:47,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2025-03-04 10:47:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:47:47,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:47,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:47,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:47:47,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:47,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash -40011754, now seen corresponding path program 1 times [2025-03-04 10:47:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:47,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361837590] [2025-03-04 10:47:47,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:48,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:47:48,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:47:48,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484852231] [2025-03-04 10:47:48,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:48,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:48,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:48,017 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-04 10:47:48,019 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-04 10:47:48,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:47:48,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:47:48,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:48,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:48,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:48,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:48,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:48,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361837590] [2025-03-04 10:47:48,090 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:48,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484852231] [2025-03-04 10:47:48,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484852231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:48,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:48,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:48,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049065716] [2025-03-04 10:47:48,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:48,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:48,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:48,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:48,091 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:48,193 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2025-03-04 10:47:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-04 10:47:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:48,194 INFO L225 Difference]: With dead ends: 179 [2025-03-04 10:47:48,194 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 10:47:48,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:48,195 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 181 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:48,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 173 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 10:47:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2025-03-04 10:47:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 98 states have (on average 1.7755102040816326) internal successors, (174), 147 states have internal predecessors, (174), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:47:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2025-03-04 10:47:48,201 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 19 [2025-03-04 10:47:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:48,201 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2025-03-04 10:47:48,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2025-03-04 10:47:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:47:48,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:48,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:48,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:47:48,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:48,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:48,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1355835210, now seen corresponding path program 1 times [2025-03-04 10:47:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075504658] [2025-03-04 10:47:48,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:48,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:47:48,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:47:48,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:48,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169793744] [2025-03-04 10:47:48,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:48,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:48,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:48,413 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-04 10:47:48,414 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-04 10:47:48,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:47:48,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:47:48,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:48,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:47:48,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:48,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:48,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075504658] [2025-03-04 10:47:48,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169793744] [2025-03-04 10:47:48,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169793744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:48,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:48,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829386652] [2025-03-04 10:47:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:48,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:48,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:48,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:48,485 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:48,627 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2025-03-04 10:47:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:48,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 10:47:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:48,630 INFO L225 Difference]: With dead ends: 180 [2025-03-04 10:47:48,630 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 10:47:48,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-04 10:47:48,630 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:48,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 270 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 10:47:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 161. [2025-03-04 10:47:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 148 states have internal predecessors, (175), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:47:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2025-03-04 10:47:48,640 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 20 [2025-03-04 10:47:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2025-03-04 10:47:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2025-03-04 10:47:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:47:48,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:48,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:48,647 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-04 10:47:48,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:48,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:48,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1240364303, now seen corresponding path program 1 times [2025-03-04 10:47:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838375069] [2025-03-04 10:47:48,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:48,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:47:48,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:47:48,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:48,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434147294] [2025-03-04 10:47:48,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:48,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:48,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:48,852 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-04 10:47:48,853 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-04 10:47:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:47:48,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:47:48,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:48,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:48,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:48,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:48,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838375069] [2025-03-04 10:47:48,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434147294] [2025-03-04 10:47:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434147294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079308700] [2025-03-04 10:47:48,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:48,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:48,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:48,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:48,907 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:48,974 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2025-03-04 10:47:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 10:47:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:48,977 INFO L225 Difference]: With dead ends: 187 [2025-03-04 10:47:48,977 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 10:47:48,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:48,977 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 99 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:48,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 227 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 10:47:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2025-03-04 10:47:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 99 states have (on average 1.7575757575757576) internal successors, (174), 148 states have internal predecessors, (174), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:47:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2025-03-04 10:47:48,983 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 20 [2025-03-04 10:47:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:48,983 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2025-03-04 10:47:48,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2025-03-04 10:47:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:47:48,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:48,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:48,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:49,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:49,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:49,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 918781458, now seen corresponding path program 1 times [2025-03-04 10:47:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596988340] [2025-03-04 10:47:49,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:49,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:47:49,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:47:49,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138498347] [2025-03-04 10:47:49,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:49,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:49,195 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-04 10:47:49,196 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-04 10:47:49,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:47:49,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:47:49,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:49,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:47:49,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:49,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:49,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596988340] [2025-03-04 10:47:49,240 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138498347] [2025-03-04 10:47:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138498347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:47:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083171843] [2025-03-04 10:47:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:49,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:47:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:49,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:47:49,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:47:49,241 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:49,310 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2025-03-04 10:47:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:47:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 10:47:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:49,312 INFO L225 Difference]: With dead ends: 271 [2025-03-04 10:47:49,312 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 10:47:49,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-04 10:47:49,313 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 55 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:49,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 202 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 10:47:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 233. [2025-03-04 10:47:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 163 states have (on average 1.7239263803680982) internal successors, (281), 212 states have internal predecessors, (281), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 10:47:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2025-03-04 10:47:49,330 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 317 transitions. Word has length 21 [2025-03-04 10:47:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:49,330 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 317 transitions. [2025-03-04 10:47:49,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2025-03-04 10:47:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:47:49,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:49,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:49,337 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-04 10:47:49,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:47:49,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:49,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 203412340, now seen corresponding path program 1 times [2025-03-04 10:47:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682017369] [2025-03-04 10:47:49,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:49,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:47:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:47:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538202005] [2025-03-04 10:47:49,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:49,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:49,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:49,546 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-04 10:47:49,548 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-04 10:47:49,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:47:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:47:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:49,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:49,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:49,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682017369] [2025-03-04 10:47:49,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538202005] [2025-03-04 10:47:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538202005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007391959] [2025-03-04 10:47:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:49,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:49,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:49,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:49,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:49,610 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:49,813 INFO L93 Difference]: Finished difference Result 258 states and 321 transitions. [2025-03-04 10:47:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 10:47:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:49,815 INFO L225 Difference]: With dead ends: 258 [2025-03-04 10:47:49,815 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 10:47:49,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:49,816 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 55 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:49,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 303 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 10:47:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2025-03-04 10:47:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 163 states have (on average 1.7116564417177915) internal successors, (279), 212 states have internal predecessors, (279), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 10:47:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 315 transitions. [2025-03-04 10:47:49,829 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 315 transitions. Word has length 21 [2025-03-04 10:47:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:49,830 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 315 transitions. [2025-03-04 10:47:49,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 315 transitions. [2025-03-04 10:47:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:47:49,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:49,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:49,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:50,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:50,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:50,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1814281648, now seen corresponding path program 1 times [2025-03-04 10:47:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290671735] [2025-03-04 10:47:50,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:50,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:47:50,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:47:50,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:50,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290671735] [2025-03-04 10:47:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290671735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:50,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:47:50,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9888221] [2025-03-04 10:47:50,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:50,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:47:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:50,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:47:50,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:50,098 INFO L87 Difference]: Start difference. First operand 233 states and 315 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:50,279 INFO L93 Difference]: Finished difference Result 262 states and 325 transitions. [2025-03-04 10:47:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:47:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-04 10:47:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:50,280 INFO L225 Difference]: With dead ends: 262 [2025-03-04 10:47:50,280 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 10:47:50,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:50,281 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 54 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:50,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 410 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 10:47:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 238. [2025-03-04 10:47:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 168 states have (on average 1.7023809523809523) internal successors, (286), 217 states have internal predecessors, (286), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 10:47:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 322 transitions. [2025-03-04 10:47:50,289 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 322 transitions. Word has length 23 [2025-03-04 10:47:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:50,289 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 322 transitions. [2025-03-04 10:47:50,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 322 transitions. [2025-03-04 10:47:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:47:50,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:50,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:50,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:47:50,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:50,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash -408156238, now seen corresponding path program 1 times [2025-03-04 10:47:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:50,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44417682] [2025-03-04 10:47:50,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:50,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:47:50,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:47:50,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796158393] [2025-03-04 10:47:50,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:50,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:50,304 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-04 10:47:50,305 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-04 10:47:50,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:47:50,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:47:50,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:50,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:47:50,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:50,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44417682] [2025-03-04 10:47:50,380 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796158393] [2025-03-04 10:47:50,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796158393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:50,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:50,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:47:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426942985] [2025-03-04 10:47:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:47:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:50,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:47:50,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:50,381 INFO L87 Difference]: Start difference. First operand 238 states and 322 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:50,493 INFO L93 Difference]: Finished difference Result 279 states and 333 transitions. [2025-03-04 10:47:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:47:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-04 10:47:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:50,495 INFO L225 Difference]: With dead ends: 279 [2025-03-04 10:47:50,495 INFO L226 Difference]: Without dead ends: 278 [2025-03-04 10:47:50,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:47:50,495 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 149 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:50,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 331 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-04 10:47:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 240. [2025-03-04 10:47:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 170 states have (on average 1.6941176470588235) internal successors, (288), 219 states have internal predecessors, (288), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 10:47:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 324 transitions. [2025-03-04 10:47:50,503 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 324 transitions. Word has length 24 [2025-03-04 10:47:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:50,503 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 324 transitions. [2025-03-04 10:47:50,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 324 transitions. [2025-03-04 10:47:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:47:50,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:50,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:50,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:47:50,704 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,SelfDestructingSolverStorable12 [2025-03-04 10:47:50,704 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:50,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1396118054, now seen corresponding path program 1 times [2025-03-04 10:47:50,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:50,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795066957] [2025-03-04 10:47:50,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:50,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:47:50,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:47:50,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795066957] [2025-03-04 10:47:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795066957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447671317] [2025-03-04 10:47:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:50,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:50,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:50,808 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-04 10:47:50,809 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-04 10:47:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:47:50,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:47:50,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:50,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:50,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:47:50,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:50,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447671317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:50,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:47:50,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-03-04 10:47:50,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988624627] [2025-03-04 10:47:50,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:50,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:47:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:50,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:47:50,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:47:50,922 INFO L87 Difference]: Start difference. First operand 240 states and 324 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:51,412 INFO L93 Difference]: Finished difference Result 533 states and 673 transitions. [2025-03-04 10:47:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:47:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-04 10:47:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:51,415 INFO L225 Difference]: With dead ends: 533 [2025-03-04 10:47:51,416 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 10:47:51,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:47:51,418 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 495 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 744 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:47:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 10:47:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 325. [2025-03-04 10:47:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 247 states have (on average 1.7530364372469636) internal successors, (433), 296 states have internal predecessors, (433), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:47:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 485 transitions. [2025-03-04 10:47:51,433 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 485 transitions. Word has length 26 [2025-03-04 10:47:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:51,434 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 485 transitions. [2025-03-04 10:47:51,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 485 transitions. [2025-03-04 10:47:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:47:51,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:51,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:51,445 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-04 10:47:51,636 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,SelfDestructingSolverStorable13 [2025-03-04 10:47:51,637 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:51,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash -329982078, now seen corresponding path program 1 times [2025-03-04 10:47:51,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328385418] [2025-03-04 10:47:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:51,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:47:51,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:47:51,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:51,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:51,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001639095] [2025-03-04 10:47:51,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:51,655 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-04 10:47:51,657 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-04 10:47:51,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:47:51,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:47:51,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:51,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:51,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:47:51,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:51,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328385418] [2025-03-04 10:47:52,000 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001639095] [2025-03-04 10:47:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001639095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:52,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:47:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-04 10:47:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431391746] [2025-03-04 10:47:52,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:52,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:47:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:52,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:47:52,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:52,001 INFO L87 Difference]: Start difference. First operand 325 states and 485 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:52,471 INFO L93 Difference]: Finished difference Result 626 states and 919 transitions. [2025-03-04 10:47:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:47:52,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-03-04 10:47:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:52,474 INFO L225 Difference]: With dead ends: 626 [2025-03-04 10:47:52,474 INFO L226 Difference]: Without dead ends: 623 [2025-03-04 10:47:52,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:47:52,475 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 768 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:52,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 788 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:47:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-04 10:47:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 360. [2025-03-04 10:47:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 280 states have (on average 1.7321428571428572) internal successors, (485), 329 states have internal predecessors, (485), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 541 transitions. [2025-03-04 10:47:52,504 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 541 transitions. Word has length 27 [2025-03-04 10:47:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:52,505 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 541 transitions. [2025-03-04 10:47:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:47:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 541 transitions. [2025-03-04 10:47:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:47:52,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:52,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:52,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:47:52,706 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,SelfDestructingSolverStorable14 [2025-03-04 10:47:52,706 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:52,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1639509749, now seen corresponding path program 1 times [2025-03-04 10:47:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706240470] [2025-03-04 10:47:52,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:52,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:47:52,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:47:52,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:52,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:52,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596997438] [2025-03-04 10:47:52,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:52,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:52,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:52,718 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-04 10:47:52,720 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-04 10:47:52,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:47:52,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:47:52,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:52,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:52,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:47:52,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:52,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706240470] [2025-03-04 10:47:53,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596997438] [2025-03-04 10:47:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596997438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:53,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:47:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-04 10:47:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451517894] [2025-03-04 10:47:53,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:53,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:47:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:53,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:47:53,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:53,057 INFO L87 Difference]: Start difference. First operand 360 states and 541 transitions. Second operand has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:47:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:53,614 INFO L93 Difference]: Finished difference Result 632 states and 908 transitions. [2025-03-04 10:47:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:47:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-03-04 10:47:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:53,616 INFO L225 Difference]: With dead ends: 632 [2025-03-04 10:47:53,616 INFO L226 Difference]: Without dead ends: 629 [2025-03-04 10:47:53,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:47:53,617 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 967 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:53,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 609 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:47:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-04 10:47:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 365. [2025-03-04 10:47:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 285 states have (on average 1.6912280701754385) internal successors, (482), 334 states have internal predecessors, (482), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 538 transitions. [2025-03-04 10:47:53,634 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 538 transitions. Word has length 28 [2025-03-04 10:47:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:53,634 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 538 transitions. [2025-03-04 10:47:53,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:47:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 538 transitions. [2025-03-04 10:47:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 10:47:53,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:53,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:53,640 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-04 10:47:53,839 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,SelfDestructingSolverStorable15 [2025-03-04 10:47:53,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:53,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash 714805408, now seen corresponding path program 1 times [2025-03-04 10:47:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337339459] [2025-03-04 10:47:53,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:53,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:47:53,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:47:53,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:53,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952201115] [2025-03-04 10:47:53,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:53,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:53,848 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-04 10:47:53,850 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-04 10:47:53,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:47:53,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:47:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:53,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:47:53,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:53,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337339459] [2025-03-04 10:47:54,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952201115] [2025-03-04 10:47:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952201115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:54,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:47:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753180064] [2025-03-04 10:47:54,052 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:54,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:47:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:54,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:47:54,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:47:54,053 INFO L87 Difference]: Start difference. First operand 365 states and 538 transitions. Second operand has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:54,255 INFO L93 Difference]: Finished difference Result 573 states and 843 transitions. [2025-03-04 10:47:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:47:54,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 10:47:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:54,258 INFO L225 Difference]: With dead ends: 573 [2025-03-04 10:47:54,258 INFO L226 Difference]: Without dead ends: 571 [2025-03-04 10:47:54,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:54,259 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 346 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:54,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 418 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-04 10:47:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 515. [2025-03-04 10:47:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 417 states have (on average 1.7194244604316546) internal successors, (717), 466 states have internal predecessors, (717), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 10:47:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 809 transitions. [2025-03-04 10:47:54,286 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 809 transitions. Word has length 29 [2025-03-04 10:47:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:54,286 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 809 transitions. [2025-03-04 10:47:54,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 809 transitions. [2025-03-04 10:47:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:47:54,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:54,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:54,292 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-04 10:47:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:54,487 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:54,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash 680406375, now seen corresponding path program 1 times [2025-03-04 10:47:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940533066] [2025-03-04 10:47:54,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:54,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:47:54,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:47:54,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:54,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:54,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940533066] [2025-03-04 10:47:54,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940533066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699979447] [2025-03-04 10:47:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:54,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:54,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:54,554 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-04 10:47:54,555 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-04 10:47:54,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:47:54,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:47:54,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:54,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:54,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:47:54,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:54,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699979447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:47:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022973479] [2025-03-04 10:47:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:47:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:54,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:47:54,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:47:54,615 INFO L87 Difference]: Start difference. First operand 515 states and 809 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:54,785 INFO L93 Difference]: Finished difference Result 707 states and 1027 transitions. [2025-03-04 10:47:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:47:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-04 10:47:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:54,787 INFO L225 Difference]: With dead ends: 707 [2025-03-04 10:47:54,787 INFO L226 Difference]: Without dead ends: 437 [2025-03-04 10:47:54,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:47:54,788 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 150 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:54,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 503 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-04 10:47:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 319. [2025-03-04 10:47:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 243 states have (on average 1.662551440329218) internal successors, (404), 288 states have internal predecessors, (404), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 460 transitions. [2025-03-04 10:47:54,803 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 460 transitions. Word has length 30 [2025-03-04 10:47:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:54,804 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 460 transitions. [2025-03-04 10:47:54,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 460 transitions. [2025-03-04 10:47:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:47:54,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:54,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:54,811 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-04 10:47:55,008 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,SelfDestructingSolverStorable17 [2025-03-04 10:47:55,008 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:55,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 684131241, now seen corresponding path program 1 times [2025-03-04 10:47:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542260059] [2025-03-04 10:47:55,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:47:55,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:47:55,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:55,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880239438] [2025-03-04 10:47:55,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:55,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:55,016 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-04 10:47:55,018 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-04 10:47:55,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:47:55,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:47:55,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:55,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:55,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:47:55,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:55,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542260059] [2025-03-04 10:47:55,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880239438] [2025-03-04 10:47:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880239438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:47:55,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:47:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:47:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000351758] [2025-03-04 10:47:55,274 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:55,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:47:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:55,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:47:55,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:47:55,274 INFO L87 Difference]: Start difference. First operand 319 states and 460 transitions. Second operand has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:55,477 INFO L93 Difference]: Finished difference Result 374 states and 484 transitions. [2025-03-04 10:47:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:47:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-04 10:47:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:55,479 INFO L225 Difference]: With dead ends: 374 [2025-03-04 10:47:55,479 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 10:47:55,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:55,479 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 313 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:55,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 533 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:47:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 10:47:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 320. [2025-03-04 10:47:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.6475409836065573) internal successors, (402), 289 states have internal predecessors, (402), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 458 transitions. [2025-03-04 10:47:55,501 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 458 transitions. Word has length 30 [2025-03-04 10:47:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:55,501 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 458 transitions. [2025-03-04 10:47:55,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:47:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 458 transitions. [2025-03-04 10:47:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:47:55,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:55,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:55,508 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-04 10:47:55,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:55,706 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1089441397, now seen corresponding path program 1 times [2025-03-04 10:47:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574843164] [2025-03-04 10:47:55,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:55,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:47:55,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:47:55,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:55,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:55,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797013625] [2025-03-04 10:47:55,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:55,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:55,723 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-04 10:47:55,725 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-04 10:47:55,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:47:55,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:47:55,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:55,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:55,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:55,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:55,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:55,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574843164] [2025-03-04 10:47:55,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797013625] [2025-03-04 10:47:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797013625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:55,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659704648] [2025-03-04 10:47:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:55,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:55,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:55,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:55,780 INFO L87 Difference]: Start difference. First operand 320 states and 458 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:47:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:55,881 INFO L93 Difference]: Finished difference Result 347 states and 469 transitions. [2025-03-04 10:47:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:55,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-04 10:47:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:55,883 INFO L225 Difference]: With dead ends: 347 [2025-03-04 10:47:55,883 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 10:47:55,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:55,884 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 91 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:55,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 213 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 10:47:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 320. [2025-03-04 10:47:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.639344262295082) internal successors, (400), 289 states have internal predecessors, (400), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2025-03-04 10:47:55,898 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 31 [2025-03-04 10:47:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:55,899 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2025-03-04 10:47:55,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:47:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2025-03-04 10:47:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:47:55,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:55,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:55,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:56,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:56,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash -266767938, now seen corresponding path program 1 times [2025-03-04 10:47:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592835707] [2025-03-04 10:47:56,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:47:56,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:47:56,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:56,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:56,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806415128] [2025-03-04 10:47:56,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:56,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:56,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:56,108 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-04 10:47:56,110 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-04 10:47:56,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:47:56,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:47:56,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:56,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:56,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:47:56,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:56,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:57,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592835707] [2025-03-04 10:47:57,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806415128] [2025-03-04 10:47:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806415128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:57,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:47:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 10:47:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823332835] [2025-03-04 10:47:57,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:57,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:47:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:57,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:47:57,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:47:57,124 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:47:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:57,687 INFO L93 Difference]: Finished difference Result 375 states and 478 transitions. [2025-03-04 10:47:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:47:57,688 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-04 10:47:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:57,689 INFO L225 Difference]: With dead ends: 375 [2025-03-04 10:47:57,689 INFO L226 Difference]: Without dead ends: 374 [2025-03-04 10:47:57,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:47:57,690 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 489 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:57,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 618 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:47:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-04 10:47:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 320. [2025-03-04 10:47:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.6270491803278688) internal successors, (397), 289 states have internal predecessors, (397), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 453 transitions. [2025-03-04 10:47:57,706 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 453 transitions. Word has length 31 [2025-03-04 10:47:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:57,706 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 453 transitions. [2025-03-04 10:47:57,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:47:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 453 transitions. [2025-03-04 10:47:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:47:57,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:57,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:57,712 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-04 10:47:57,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:57,907 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -587055005, now seen corresponding path program 1 times [2025-03-04 10:47:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752867087] [2025-03-04 10:47:57,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:57,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:47:57,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:47:57,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:57,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:57,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500809855] [2025-03-04 10:47:57,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:57,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:57,916 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-04 10:47:57,917 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-04 10:47:57,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:47:57,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:47:57,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:57,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:57,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:47:57,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:57,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:47:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752867087] [2025-03-04 10:47:57,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500809855] [2025-03-04 10:47:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500809855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:47:57,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:47:57,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:47:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155692625] [2025-03-04 10:47:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:47:57,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:47:57,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:57,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:47:57,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:57,984 INFO L87 Difference]: Start difference. First operand 320 states and 453 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:47:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:58,129 INFO L93 Difference]: Finished difference Result 348 states and 465 transitions. [2025-03-04 10:47:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:47:58,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-04 10:47:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:58,133 INFO L225 Difference]: With dead ends: 348 [2025-03-04 10:47:58,133 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 10:47:58,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:47:58,134 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 55 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:58,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 275 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:47:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 10:47:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2025-03-04 10:47:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.6188524590163935) internal successors, (395), 289 states have internal predecessors, (395), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 451 transitions. [2025-03-04 10:47:58,153 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 451 transitions. Word has length 32 [2025-03-04 10:47:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:58,153 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 451 transitions. [2025-03-04 10:47:58,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:47:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 451 transitions. [2025-03-04 10:47:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:47:58,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:58,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:58,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:58,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:58,355 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:58,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 320128583, now seen corresponding path program 1 times [2025-03-04 10:47:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921946129] [2025-03-04 10:47:58,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:58,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:58,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:47:58,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:47:58,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:58,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:58,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848445247] [2025-03-04 10:47:58,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:58,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:58,363 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-04 10:47:58,364 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-04 10:47:58,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:47:58,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:47:58,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:58,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:58,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:47:58,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:58,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:47:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:47:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:47:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921946129] [2025-03-04 10:47:58,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:47:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848445247] [2025-03-04 10:47:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848445247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:47:58,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:47:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 10:47:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14591386] [2025-03-04 10:47:58,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:47:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:47:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:47:58,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:47:58,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:47:58,611 INFO L87 Difference]: Start difference. First operand 320 states and 451 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:47:59,347 INFO L93 Difference]: Finished difference Result 375 states and 473 transitions. [2025-03-04 10:47:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:47:59,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 10:47:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:47:59,348 INFO L225 Difference]: With dead ends: 375 [2025-03-04 10:47:59,348 INFO L226 Difference]: Without dead ends: 374 [2025-03-04 10:47:59,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:47:59,349 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 261 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:47:59,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 585 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:47:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-04 10:47:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 320. [2025-03-04 10:47:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.6065573770491803) internal successors, (392), 289 states have internal predecessors, (392), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:47:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2025-03-04 10:47:59,365 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 32 [2025-03-04 10:47:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:47:59,365 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2025-03-04 10:47:59,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:47:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2025-03-04 10:47:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:47:59,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:47:59,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:47:59,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:47:59,566 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,SelfDestructingSolverStorable22 [2025-03-04 10:47:59,566 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:47:59,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:47:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -38014068, now seen corresponding path program 1 times [2025-03-04 10:47:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:47:59,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505253143] [2025-03-04 10:47:59,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:47:59,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:47:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:47:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:47:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75693112] [2025-03-04 10:47:59,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:47:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:47:59,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:47:59,576 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-04 10:47:59,576 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-04 10:47:59,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:47:59,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:47:59,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:47:59,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:47:59,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:47:59,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:47:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:47:59,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505253143] [2025-03-04 10:48:06,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75693112] [2025-03-04 10:48:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75693112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:06,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:48:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839281003] [2025-03-04 10:48:06,773 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:06,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:48:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:06,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:48:06,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=113, Unknown=2, NotChecked=0, Total=156 [2025-03-04 10:48:06,773 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:48:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:06,970 INFO L93 Difference]: Finished difference Result 378 states and 478 transitions. [2025-03-04 10:48:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:48:06,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2025-03-04 10:48:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:06,971 INFO L225 Difference]: With dead ends: 378 [2025-03-04 10:48:06,971 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 10:48:06,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=41, Invalid=113, Unknown=2, NotChecked=0, Total=156 [2025-03-04 10:48:06,972 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 249 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:06,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 624 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 10:48:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 321. [2025-03-04 10:48:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 245 states have (on average 1.5918367346938775) internal successors, (390), 290 states have internal predecessors, (390), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:48:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 446 transitions. [2025-03-04 10:48:06,988 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 446 transitions. Word has length 38 [2025-03-04 10:48:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:06,988 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 446 transitions. [2025-03-04 10:48:06,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:48:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 446 transitions. [2025-03-04 10:48:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 10:48:06,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:06,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:06,994 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-04 10:48:07,189 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,SelfDestructingSolverStorable23 [2025-03-04 10:48:07,189 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:48:07,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1178436044, now seen corresponding path program 1 times [2025-03-04 10:48:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:07,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150402986] [2025-03-04 10:48:07,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:07,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:48:07,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:48:07,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:07,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:07,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932406148] [2025-03-04 10:48:07,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:07,200 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-04 10:48:07,202 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-04 10:48:07,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:48:07,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:48:07,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:07,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:07,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:48:07,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:48:07,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:07,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150402986] [2025-03-04 10:48:07,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932406148] [2025-03-04 10:48:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932406148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:07,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:07,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:48:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568914279] [2025-03-04 10:48:07,581 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:48:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:07,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:48:07,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:48:07,582 INFO L87 Difference]: Start difference. First operand 321 states and 446 transitions. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:48:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:07,783 INFO L93 Difference]: Finished difference Result 378 states and 474 transitions. [2025-03-04 10:48:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:48:07,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2025-03-04 10:48:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:07,785 INFO L225 Difference]: With dead ends: 378 [2025-03-04 10:48:07,785 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 10:48:07,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:48:07,785 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 540 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:07,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 411 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 10:48:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 322. [2025-03-04 10:48:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 246 states have (on average 1.5772357723577235) internal successors, (388), 291 states have internal predecessors, (388), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:48:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 444 transitions. [2025-03-04 10:48:07,805 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 444 transitions. Word has length 39 [2025-03-04 10:48:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:07,805 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 444 transitions. [2025-03-04 10:48:07,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:48:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 444 transitions. [2025-03-04 10:48:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:48:07,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:07,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:07,814 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-04 10:48:08,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:08,008 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:48:08,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash 270102973, now seen corresponding path program 1 times [2025-03-04 10:48:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:08,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144468867] [2025-03-04 10:48:08,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:08,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:48:08,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:48:08,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:48:08,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144468867] [2025-03-04 10:48:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144468867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:48:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743609353] [2025-03-04 10:48:08,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:08,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:08,085 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:08,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:48:08,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:48:08,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:48:08,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:08,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:48:08,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:48:08,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:48:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743609353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:48:08,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:48:08,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-04 10:48:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678354392] [2025-03-04 10:48:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:48:08,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:48:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:08,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:48:08,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:48:08,220 INFO L87 Difference]: Start difference. First operand 322 states and 444 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:48:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:08,417 INFO L93 Difference]: Finished difference Result 345 states and 452 transitions. [2025-03-04 10:48:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:48:08,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-03-04 10:48:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:08,418 INFO L225 Difference]: With dead ends: 345 [2025-03-04 10:48:08,419 INFO L226 Difference]: Without dead ends: 344 [2025-03-04 10:48:08,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:48:08,419 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 216 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:08,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 249 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:48:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-04 10:48:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 322. [2025-03-04 10:48:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 246 states have (on average 1.5731707317073171) internal successors, (387), 291 states have internal predecessors, (387), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:48:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 443 transitions. [2025-03-04 10:48:08,435 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 443 transitions. Word has length 40 [2025-03-04 10:48:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:08,436 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 443 transitions. [2025-03-04 10:48:08,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:48:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 443 transitions. [2025-03-04 10:48:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:48:08,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:08,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:08,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:08,637 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:48:08,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2123188362, now seen corresponding path program 1 times [2025-03-04 10:48:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993499366] [2025-03-04 10:48:08,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:08,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:48:08,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:48:08,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:08,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848808957] [2025-03-04 10:48:08,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:08,645 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:08,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:48:08,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:48:08,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:48:08,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:08,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:08,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:48:08,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:48:08,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:48:18,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993499366] [2025-03-04 10:48:18,037 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848808957] [2025-03-04 10:48:18,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848808957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:18,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:48:18,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-04 10:48:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660194469] [2025-03-04 10:48:18,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:18,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:48:18,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:18,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:48:18,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=182, Unknown=3, NotChecked=0, Total=240 [2025-03-04 10:48:18,038 INFO L87 Difference]: Start difference. First operand 322 states and 443 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:48:22,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:25,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:29,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:29,494 INFO L93 Difference]: Finished difference Result 622 states and 792 transitions. [2025-03-04 10:48:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:48:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-03-04 10:48:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:29,496 INFO L225 Difference]: With dead ends: 622 [2025-03-04 10:48:29,496 INFO L226 Difference]: Without dead ends: 621 [2025-03-04 10:48:29,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=167, Invalid=430, Unknown=3, NotChecked=0, Total=600 [2025-03-04 10:48:29,497 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1427 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 91 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:29,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 587 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 516 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2025-03-04 10:48:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-04 10:48:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 333. [2025-03-04 10:48:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 256 states have (on average 1.55078125) internal successors, (397), 301 states have internal predecessors, (397), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 10:48:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 455 transitions. [2025-03-04 10:48:29,517 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 455 transitions. Word has length 40 [2025-03-04 10:48:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:29,517 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 455 transitions. [2025-03-04 10:48:29,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:48:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 455 transitions. [2025-03-04 10:48:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:48:29,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:29,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:29,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 10:48:29,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:48:29,718 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:48:29,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash -216742382, now seen corresponding path program 1 times [2025-03-04 10:48:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:29,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566699087] [2025-03-04 10:48:29,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:29,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:48:29,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:48:29,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:29,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:29,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124047025] [2025-03-04 10:48:29,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:29,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:29,729 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:29,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:48:29,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:48:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:48:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:29,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:48:29,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:48:29,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:48:29,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566699087] [2025-03-04 10:48:29,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124047025] [2025-03-04 10:48:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124047025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:48:29,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:48:29,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:48:29,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080222708] [2025-03-04 10:48:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:48:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:48:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:29,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:48:29,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:48:29,802 INFO L87 Difference]: Start difference. First operand 333 states and 455 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:48:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:48:29,957 INFO L93 Difference]: Finished difference Result 362 states and 463 transitions. [2025-03-04 10:48:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:48:29,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-03-04 10:48:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:48:29,958 INFO L225 Difference]: With dead ends: 362 [2025-03-04 10:48:29,958 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 10:48:29,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:48:29,959 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 250 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:48:29,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 240 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:48:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 10:48:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 333. [2025-03-04 10:48:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 256 states have (on average 1.546875) internal successors, (396), 301 states have internal predecessors, (396), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 10:48:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 454 transitions. [2025-03-04 10:48:29,985 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 454 transitions. Word has length 41 [2025-03-04 10:48:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:48:29,985 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 454 transitions. [2025-03-04 10:48:29,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:48:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 454 transitions. [2025-03-04 10:48:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:48:29,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:48:29,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:48:29,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:48:30,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:48:30,186 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:48:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:48:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1394329842, now seen corresponding path program 1 times [2025-03-04 10:48:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:48:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354058193] [2025-03-04 10:48:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:48:30,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:48:30,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:48:30,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:30,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:48:30,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228259689] [2025-03-04 10:48:30,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:48:30,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:48:30,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:48:30,195 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:48:30,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:48:30,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:48:30,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:48:30,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:48:30,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:48:30,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:48:30,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:48:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:48:30,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:48:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:48:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:48:30,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354058193] [2025-03-04 10:48:30,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:48:30,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228259689] [2025-03-04 10:48:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228259689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:48:30,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:48:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-04 10:48:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224460029] [2025-03-04 10:48:30,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:48:30,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:48:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:48:30,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:48:30,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:48:30,663 INFO L87 Difference]: Start difference. First operand 333 states and 454 transitions. Second operand has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:48:34,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:38,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:42,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:46,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:49,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:50,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:53,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:48:56,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:49:00,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:49:05,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:49:09,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:49:13,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:49:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:13,931 INFO L93 Difference]: Finished difference Result 622 states and 790 transitions. [2025-03-04 10:49:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:49:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-04 10:49:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:13,933 INFO L225 Difference]: With dead ends: 622 [2025-03-04 10:49:13,933 INFO L226 Difference]: Without dead ends: 621 [2025-03-04 10:49:13,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:49:13,934 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1485 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 110 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:13,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 839 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 834 Invalid, 12 Unknown, 0 Unchecked, 43.1s Time] [2025-03-04 10:49:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-04 10:49:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 323. [2025-03-04 10:49:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 247 states have (on average 1.5668016194331984) internal successors, (387), 292 states have internal predecessors, (387), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:49:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 443 transitions. [2025-03-04 10:49:13,968 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 443 transitions. Word has length 41 [2025-03-04 10:49:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:13,968 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 443 transitions. [2025-03-04 10:49:13,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:49:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 443 transitions. [2025-03-04 10:49:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:49:13,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:13,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:13,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:49:14,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:49:14,169 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:14,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash 274552200, now seen corresponding path program 1 times [2025-03-04 10:49:14,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:14,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815871721] [2025-03-04 10:49:14,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:14,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:49:14,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:49:14,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:14,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:49:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166599468] [2025-03-04 10:49:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:14,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:49:14,179 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:49:14,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:49:14,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:49:14,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:49:14,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:14,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:14,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:49:14,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:49:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:49:14,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:49:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:49:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815871721] [2025-03-04 10:49:14,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:49:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166599468] [2025-03-04 10:49:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166599468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:49:14,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:49:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:49:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033196851] [2025-03-04 10:49:14,413 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:49:14,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:49:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:49:14,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:49:14,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:49:14,413 INFO L87 Difference]: Start difference. First operand 323 states and 443 transitions. Second operand has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:49:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:14,706 INFO L93 Difference]: Finished difference Result 388 states and 480 transitions. [2025-03-04 10:49:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:49:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2025-03-04 10:49:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:14,707 INFO L225 Difference]: With dead ends: 388 [2025-03-04 10:49:14,707 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 10:49:14,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:49:14,707 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 433 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:14,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 604 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:49:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 10:49:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 323. [2025-03-04 10:49:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 247 states have (on average 1.5587044534412955) internal successors, (385), 292 states have internal predecessors, (385), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:49:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 441 transitions. [2025-03-04 10:49:14,729 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 441 transitions. Word has length 42 [2025-03-04 10:49:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:14,729 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 441 transitions. [2025-03-04 10:49:14,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:49:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 441 transitions. [2025-03-04 10:49:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:49:14,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:14,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:14,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:49:14,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:14,931 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:14,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -78816336, now seen corresponding path program 1 times [2025-03-04 10:49:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014637139] [2025-03-04 10:49:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:14,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:49:14,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:49:14,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:14,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:49:14,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642317106] [2025-03-04 10:49:14,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:14,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:14,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:49:14,941 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:49:14,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:49:14,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:49:14,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:49:14,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:14,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:14,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:49:14,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:49:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:49:15,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:49:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:49:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014637139] [2025-03-04 10:49:15,172 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:49:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642317106] [2025-03-04 10:49:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642317106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:49:15,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:49:15,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:49:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649430227] [2025-03-04 10:49:15,173 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:49:15,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:49:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:49:15,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:49:15,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:49:15,173 INFO L87 Difference]: Start difference. First operand 323 states and 441 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:49:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:15,499 INFO L93 Difference]: Finished difference Result 438 states and 560 transitions. [2025-03-04 10:49:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:49:15,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-04 10:49:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:15,501 INFO L225 Difference]: With dead ends: 438 [2025-03-04 10:49:15,501 INFO L226 Difference]: Without dead ends: 437 [2025-03-04 10:49:15,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:49:15,501 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 297 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:15,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 403 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:49:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-04 10:49:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 386. [2025-03-04 10:49:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 302 states have (on average 1.5529801324503312) internal successors, (469), 347 states have internal predecessors, (469), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 10:49:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 541 transitions. [2025-03-04 10:49:15,527 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 541 transitions. Word has length 43 [2025-03-04 10:49:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:15,527 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 541 transitions. [2025-03-04 10:49:15,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:49:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 541 transitions. [2025-03-04 10:49:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:49:15,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:15,528 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:15,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-04 10:49:15,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:15,728 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:15,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -482456567, now seen corresponding path program 1 times [2025-03-04 10:49:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972734070] [2025-03-04 10:49:15,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:15,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:49:15,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:49:15,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:15,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:49:15,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649807449] [2025-03-04 10:49:15,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:15,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:15,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:49:15,738 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:49:15,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:49:15,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:49:15,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:49:15,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:15,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:15,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:49:15,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:49:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:49:15,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:49:15,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:49:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972734070] [2025-03-04 10:49:15,843 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:49:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649807449] [2025-03-04 10:49:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649807449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:49:15,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:49:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:49:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155207982] [2025-03-04 10:49:15,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:49:15,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:49:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:49:15,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:49:15,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:49:15,844 INFO L87 Difference]: Start difference. First operand 386 states and 541 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:49:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:16,053 INFO L93 Difference]: Finished difference Result 461 states and 629 transitions. [2025-03-04 10:49:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:49:16,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-03-04 10:49:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:16,055 INFO L225 Difference]: With dead ends: 461 [2025-03-04 10:49:16,055 INFO L226 Difference]: Without dead ends: 458 [2025-03-04 10:49:16,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:49:16,055 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 195 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:16,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 251 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:49:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-04 10:49:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 440. [2025-03-04 10:49:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 348 states have (on average 1.514367816091954) internal successors, (527), 393 states have internal predecessors, (527), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 10:49:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 615 transitions. [2025-03-04 10:49:16,087 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 615 transitions. Word has length 47 [2025-03-04 10:49:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:16,087 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 615 transitions. [2025-03-04 10:49:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:49:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 615 transitions. [2025-03-04 10:49:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:49:16,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:16,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:16,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 10:49:16,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:16,288 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:16,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2071251647, now seen corresponding path program 1 times [2025-03-04 10:49:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260612018] [2025-03-04 10:49:16,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:16,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:49:16,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:49:16,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:16,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:49:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302113363] [2025-03-04 10:49:16,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:16,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:16,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:49:16,297 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:49:16,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:49:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:49:16,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:49:16,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:16,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:16,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:49:16,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:49:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:49:16,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:49:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:49:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260612018] [2025-03-04 10:49:16,381 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:49:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302113363] [2025-03-04 10:49:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302113363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:49:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:49:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:49:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771214857] [2025-03-04 10:49:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:49:16,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:49:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:49:16,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:49:16,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:49:16,382 INFO L87 Difference]: Start difference. First operand 440 states and 615 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:49:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:16,582 INFO L93 Difference]: Finished difference Result 459 states and 623 transitions. [2025-03-04 10:49:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:49:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-03-04 10:49:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:16,584 INFO L225 Difference]: With dead ends: 459 [2025-03-04 10:49:16,584 INFO L226 Difference]: Without dead ends: 458 [2025-03-04 10:49:16,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:49:16,584 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 206 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:16,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 187 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:49:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-04 10:49:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 440. [2025-03-04 10:49:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 348 states have (on average 1.5086206896551724) internal successors, (525), 393 states have internal predecessors, (525), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 10:49:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 613 transitions. [2025-03-04 10:49:16,613 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 613 transitions. Word has length 48 [2025-03-04 10:49:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:16,613 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 613 transitions. [2025-03-04 10:49:16,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:49:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 613 transitions. [2025-03-04 10:49:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:49:16,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:16,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:16,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-04 10:49:16,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:49:16,814 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:16,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2085687286, now seen corresponding path program 1 times [2025-03-04 10:49:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201368366] [2025-03-04 10:49:16,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:16,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:49:16,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:49:16,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:16,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:49:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:49:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201368366] [2025-03-04 10:49:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201368366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:49:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116964238] [2025-03-04 10:49:16,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:49:16,958 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:49:16,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:49:16,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:49:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:49:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:16,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:16,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:49:16,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:49:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:49:17,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:49:21,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116964238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:49:21,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:49:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2025-03-04 10:49:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919629964] [2025-03-04 10:49:21,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:49:21,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:49:21,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:49:21,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:49:21,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2025-03-04 10:49:21,110 INFO L87 Difference]: Start difference. First operand 440 states and 613 transitions. Second operand has 15 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:49:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:21,968 INFO L93 Difference]: Finished difference Result 659 states and 811 transitions. [2025-03-04 10:49:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:49:21,968 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2025-03-04 10:49:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:21,970 INFO L225 Difference]: With dead ends: 659 [2025-03-04 10:49:21,970 INFO L226 Difference]: Without dead ends: 658 [2025-03-04 10:49:21,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=255, Invalid=800, Unknown=1, NotChecked=0, Total=1056 [2025-03-04 10:49:21,971 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1244 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:21,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 697 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:49:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-04 10:49:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 491. [2025-03-04 10:49:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 394 states have (on average 1.532994923857868) internal successors, (604), 439 states have internal predecessors, (604), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 10:49:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 702 transitions. [2025-03-04 10:49:22,005 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 702 transitions. Word has length 51 [2025-03-04 10:49:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:22,005 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 702 transitions. [2025-03-04 10:49:22,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 10:49:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 702 transitions. [2025-03-04 10:49:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 10:49:22,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:22,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:22,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 10:49:22,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:22,206 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -231796379, now seen corresponding path program 1 times [2025-03-04 10:49:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052161901] [2025-03-04 10:49:22,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:22,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:49:22,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:49:22,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:22,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:49:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512314429] [2025-03-04 10:49:22,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:22,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:49:22,216 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:49:22,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:49:22,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:49:22,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:49:22,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:22,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:22,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:49:22,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:49:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:49:22,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:49:26,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:49:26,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052161901] [2025-03-04 10:49:26,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:49:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512314429] [2025-03-04 10:49:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512314429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:49:26,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:49:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:49:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347630309] [2025-03-04 10:49:26,388 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:49:26,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:49:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:49:26,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:49:26,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2025-03-04 10:49:26,388 INFO L87 Difference]: Start difference. First operand 491 states and 702 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:49:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:26,654 INFO L93 Difference]: Finished difference Result 536 states and 726 transitions. [2025-03-04 10:49:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:49:26,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-03-04 10:49:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:26,656 INFO L225 Difference]: With dead ends: 536 [2025-03-04 10:49:26,656 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 10:49:26,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=59, Invalid=122, Unknown=1, NotChecked=0, Total=182 [2025-03-04 10:49:26,656 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 337 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:26,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 290 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:49:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 10:49:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 491. [2025-03-04 10:49:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 394 states have (on average 1.5228426395939085) internal successors, (600), 439 states have internal predecessors, (600), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 10:49:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 698 transitions. [2025-03-04 10:49:26,698 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 698 transitions. Word has length 52 [2025-03-04 10:49:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:26,699 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 698 transitions. [2025-03-04 10:49:26,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:49:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 698 transitions. [2025-03-04 10:49:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:49:26,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:26,699 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:26,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-04 10:49:26,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:26,903 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:26,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1967084937, now seen corresponding path program 1 times [2025-03-04 10:49:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174521321] [2025-03-04 10:49:26,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:26,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:49:26,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:49:26,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:26,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:49:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:49:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:49:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174521321] [2025-03-04 10:49:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174521321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:49:26,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:49:26,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:49:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126266569] [2025-03-04 10:49:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:49:26,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:49:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:49:26,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:49:26,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:49:26,983 INFO L87 Difference]: Start difference. First operand 491 states and 698 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:49:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:49:27,197 INFO L93 Difference]: Finished difference Result 507 states and 698 transitions. [2025-03-04 10:49:27,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:49:27,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2025-03-04 10:49:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:49:27,199 INFO L225 Difference]: With dead ends: 507 [2025-03-04 10:49:27,199 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 10:49:27,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:49:27,199 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 163 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:49:27,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 407 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:49:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 10:49:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 491. [2025-03-04 10:49:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 439 states have internal predecessors, (594), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 10:49:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 692 transitions. [2025-03-04 10:49:27,232 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 692 transitions. Word has length 54 [2025-03-04 10:49:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:49:27,232 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 692 transitions. [2025-03-04 10:49:27,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:49:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 692 transitions. [2025-03-04 10:49:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:49:27,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:49:27,232 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:27,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 10:49:27,233 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:49:27,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:49:27,233 INFO L85 PathProgramCache]: Analyzing trace with hash -850090866, now seen corresponding path program 1 times [2025-03-04 10:49:27,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:49:27,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359795225] [2025-03-04 10:49:27,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:27,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:49:27,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:49:27,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:49:27,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:27,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:49:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907615501] [2025-03-04 10:49:27,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:49:27,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:49:27,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:49:27,245 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:49:27,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:49:27,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:49:27,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:49:27,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:27,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:49:27,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:49:27,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:49:27,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:49:27,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:49:27,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:49:27,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:49:27,295 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:49:27,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-03-04 10:49:27,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-03-04 10:49:27,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-03-04 10:49:27,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-03-04 10:49:27,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-03-04 10:49:27,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-03-04 10:49:27,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-03-04 10:49:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 10:49:27,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:49:27,503 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:49:27,527 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:49:27,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:49:27 BoogieIcfgContainer [2025-03-04 10:49:27,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:49:27,533 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:49:27,533 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:49:27,533 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:49:27,534 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:47:45" (3/4) ... [2025-03-04 10:49:27,535 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 10:49:27,579 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 21. [2025-03-04 10:49:27,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:49:27,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:49:27,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:49:27,628 INFO L158 Benchmark]: Toolchain (without parser) took 102651.68ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.7MB in the beginning and 72.4MB in the end (delta: 38.3MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. [2025-03-04 10:49:27,628 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:49:27,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.41ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 99.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:49:27,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.35ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 98.2MB in the end (delta: 982.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:49:27,630 INFO L158 Benchmark]: Boogie Preprocessor took 33.45ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:49:27,630 INFO L158 Benchmark]: IcfgBuilder took 419.44ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 75.8MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:49:27,630 INFO L158 Benchmark]: TraceAbstraction took 101889.24ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 74.9MB in the beginning and 80.8MB in the end (delta: -5.9MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2025-03-04 10:49:27,631 INFO L158 Benchmark]: Witness Printer took 94.21ms. Allocated memory is still 176.2MB. Free memory was 80.8MB in the beginning and 72.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:49:27,631 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.41ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 99.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.35ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 98.2MB in the end (delta: 982.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.45ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 419.44ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 75.8MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 101889.24ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 74.9MB in the beginning and 80.8MB in the end (delta: -5.9MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Witness Printer took 94.21ms. Allocated memory is still 176.2MB. Free memory was 80.8MB in the beginning and 72.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 53]: integer overflow possible integer overflow possible We found a FailurePath: [L19] int x, y; [L20] int a, b, p, q, r, s; [L21] x = __VERIFIER_nondet_int() [L22] y = __VERIFIER_nondet_int() [L23] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1] [L8] COND FALSE !(!cond) VAL [\old(cond)=1] [L23] RET assume_abort_if_not(x >= 1) VAL [x=1073741824, y=1073741824] [L24] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1] [L8] COND FALSE !(!cond) VAL [\old(cond)=1] [L24] RET assume_abort_if_not(y >= 1) VAL [x=1073741824, y=1073741824] [L26] a = x [L27] b = y [L28] p = 1 [L29] q = 0 [L30] r = 0 [L31] s = 1 VAL [a=1073741824, b=1073741824, p=1, q=0, r=0, s=1, x=1073741824, y=1073741824] [L34] COND FALSE !(!(b != 0)) [L36] int c, k; [L37] c = a [L38] k = 0 VAL [a=1073741824, b=1073741824, c=1073741824, k=0, p=1, q=0, r=0, s=1, x=1073741824, y=1073741824] [L41] COND FALSE !(!(c >= b)) [L43] int d, v; [L44] d = 1 [L45] v = b VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L48] EXPR y * r VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L48] EXPR x * p VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L48] EXPR y * r + x * p VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L48] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L48] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L49] EXPR x * q VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L49] EXPR y * s VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L49] EXPR x * q + y * s VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L49] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L50] EXPR k * b VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L50] EXPR k * b + c VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L50] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L50] RET __VERIFIER_assert(a == k * b + c) VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L51] EXPR b * d VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L51] CALL __VERIFIER_assert(v == b * d) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L51] RET __VERIFIER_assert(v == b * d) VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, v=1073741824, x=1073741824, y=1073741824] [L53] 2 * v VAL [a=1073741824, b=1073741824, c=1073741824, d=1, k=0, p=1, q=0, r=0, s=1, x=1073741824, y=1073741824] - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 101.8s, OverallIterations: 37, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 63.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 12317 SdHoareTripleChecker+Valid, 61.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12129 mSDsluCounter, 14439 SdHoareTripleChecker+Invalid, 60.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10623 mSDsCounter, 666 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10000 IncrementalHoareTripleChecker+Invalid, 10680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 666 mSolverCounterUnsat, 3816 mSDtfsCounter, 10000 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 1144 SyntacticMatches, 6 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 27.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=17, InterpolantAutomatonStates: 274, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 2546 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 2239 NumberOfCodeBlocks, 2239 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1459 ConstructedInterpolants, 77 QuantifiedInterpolants, 7010 SizeOfPredicates, 25 NumberOfNonLiveVariables, 3526 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 48 InterpolantComputations, 21 PerfectInterpolantSequences, 240/321 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 10:49:27,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)