./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.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 95c338a7a91abcfb8302c7314ea1de7bdde280884a10e8d539233a34032b9a5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:10:21,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:10:21,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:10:21,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:10:21,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:10:21,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:10:21,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:10:21,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:10:21,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:10:21,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:10:21,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:10:21,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:10:21,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:10:21,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:10:21,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:10:21,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:10:21,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:10:21,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:10:21,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:10:21,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:10:21,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:10:21,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:10:21,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:10:21,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:10:21,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:10:21,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:10:21,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:10:21,973 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 -> 95c338a7a91abcfb8302c7314ea1de7bdde280884a10e8d539233a34032b9a5d [2025-03-17 15:10:22,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:10:22,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:10:22,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:10:22,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:10:22,187 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:10:22,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2025-03-17 15:10:23,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa32844e/8d6650b9d4e44bedaf856ebc2fc2ce86/FLAGc8df1dc54 [2025-03-17 15:10:23,433 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:10:23,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2025-03-17 15:10:23,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa32844e/8d6650b9d4e44bedaf856ebc2fc2ce86/FLAGc8df1dc54 [2025-03-17 15:10:23,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa32844e/8d6650b9d4e44bedaf856ebc2fc2ce86 [2025-03-17 15:10:23,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:10:23,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:10:23,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:10:23,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:10:23,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:10:23,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e3aef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23, skipping insertion in model container [2025-03-17 15:10:23,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:10:23,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:10:23,630 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:10:23,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:10:23,655 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:10:23,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23 WrapperNode [2025-03-17 15:10:23,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:10:23,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:10:23,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:10:23,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:10:23,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,681 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-17 15:10:23,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:10:23,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:10:23,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:10:23,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:10:23,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,698 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:10:23,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:10:23,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:10:23,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:10:23,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:10:23,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (1/1) ... [2025-03-17 15:10:23,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:10:23,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:23,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:10:23,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:10:23,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:10:23,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:10:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:10:23,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:10:23,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:10:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:10:23,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:10:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:10:23,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:10:23,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:10:24,009 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-17 15:10:24,010 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:10:24,018 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:10:24,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:10:24,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:24 BoogieIcfgContainer [2025-03-17 15:10:24,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:10:24,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:10:24,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:10:24,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:10:24,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:10:23" (1/3) ... [2025-03-17 15:10:24,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c744545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:24, skipping insertion in model container [2025-03-17 15:10:24,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:23" (2/3) ... [2025-03-17 15:10:24,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c744545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:24, skipping insertion in model container [2025-03-17 15:10:24,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:24" (3/3) ... [2025-03-17 15:10:24,025 INFO L128 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound2.c [2025-03-17 15:10:24,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:10:24,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohendiv-ll_valuebound2.c that has 3 procedures, 86 locations, 1 initial locations, 2 loop locations, and 30 error locations. [2025-03-17 15:10:24,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:10:24,076 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;@3de44e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:10:24,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 15:10:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 73 states have internal predecessors, (79), 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-17 15:10:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:10:24,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:24,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:24,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:24,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash 872082966, now seen corresponding path program 1 times [2025-03-17 15:10:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990021401] [2025-03-17 15:10:24,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:24,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:10:24,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:10:24,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:24,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:10:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:24,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990021401] [2025-03-17 15:10:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990021401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894461288] [2025-03-17 15:10:24,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:24,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:24,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:24,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:24,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:10:24,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:10:24,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:10:24,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:24,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:24,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:10:24,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:10:24,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894461288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:10:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925574498] [2025-03-17 15:10:24,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:10:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:24,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:10:24,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:10:24,271 INFO L87 Difference]: Start difference. First operand has 86 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 73 states have internal predecessors, (79), 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:10:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:24,291 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2025-03-17 15:10:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:10:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-17 15:10:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:24,297 INFO L225 Difference]: With dead ends: 170 [2025-03-17 15:10:24,298 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 15:10:24,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:10:24,303 INFO L435 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:24,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:10:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 15:10:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 15:10:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 70 states have internal predecessors, (72), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:10:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-03-17 15:10:24,329 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 19 [2025-03-17 15:10:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:24,329 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-03-17 15:10:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:10:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-03-17 15:10:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:10:24,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:24,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:24,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:24,535 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-17 15:10:24,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:24,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash 165958805, now seen corresponding path program 1 times [2025-03-17 15:10:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:24,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456322697] [2025-03-17 15:10:24,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:24,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:24,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:10:24,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:10:24,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:24,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656110492] [2025-03-17 15:10:24,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:24,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:24,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:24,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:24,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:10:24,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:10:24,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:10:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:24,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:24,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:10:24,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:10:24,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:24,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456322697] [2025-03-17 15:10:24,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:24,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656110492] [2025-03-17 15:10:24,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656110492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:24,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:24,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:10:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182861412] [2025-03-17 15:10:24,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:24,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:10:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:24,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:10:24,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:10:24,628 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:10:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:24,693 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-03-17 15:10:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:10:24,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2025-03-17 15:10:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:24,694 INFO L225 Difference]: With dead ends: 105 [2025-03-17 15:10:24,694 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 15:10:24,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:10:24,695 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:24,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 155 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 15:10:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2025-03-17 15:10:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 72 states have internal predecessors, (74), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:10:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2025-03-17 15:10:24,704 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 19 [2025-03-17 15:10:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:24,704 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-03-17 15:10:24,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:10:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2025-03-17 15:10:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 15:10:24,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:24,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:24,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:24,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,SelfDestructingSolverStorable1 [2025-03-17 15:10:24,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:24,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash 523255588, now seen corresponding path program 1 times [2025-03-17 15:10:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:24,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785481290] [2025-03-17 15:10:24,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:24,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 15:10:24,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 15:10:24,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:24,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144035279] [2025-03-17 15:10:24,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:24,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:24,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:24,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:24,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:10:24,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 15:10:24,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 15:10:24,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:24,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:24,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:10:24,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:10:24,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785481290] [2025-03-17 15:10:24,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144035279] [2025-03-17 15:10:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144035279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:10:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640992656] [2025-03-17 15:10:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:10:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:24,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:10:24,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:10:24,990 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-17 15:10:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:25,080 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2025-03-17 15:10:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:10:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 26 [2025-03-17 15:10:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:25,081 INFO L225 Difference]: With dead ends: 140 [2025-03-17 15:10:25,081 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 15:10:25,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:10:25,083 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 44 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:25,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 15:10:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2025-03-17 15:10:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 96 states have internal predecessors, (116), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:10:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2025-03-17 15:10:25,106 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 26 [2025-03-17 15:10:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:25,106 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2025-03-17 15:10:25,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-17 15:10:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2025-03-17 15:10:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 15:10:25,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:25,107 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:25,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:25,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:25,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:25,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 337447586, now seen corresponding path program 1 times [2025-03-17 15:10:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304521683] [2025-03-17 15:10:25,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:25,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:10:25,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:10:25,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:25,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:10:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:25,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304521683] [2025-03-17 15:10:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304521683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587718715] [2025-03-17 15:10:25,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:25,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:25,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:10:25,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:10:25,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:10:25,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:25,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:25,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:10:25,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:10:25,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587718715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-17 15:10:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992761986] [2025-03-17 15:10:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:25,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:25,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:25,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:10:25,550 INFO L87 Difference]: Start difference. First operand 114 states and 146 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-17 15:10:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:25,637 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2025-03-17 15:10:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:10:25,638 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), 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 28 [2025-03-17 15:10:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:25,638 INFO L225 Difference]: With dead ends: 133 [2025-03-17 15:10:25,638 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 15:10:25,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:10:25,639 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 150 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:25,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 135 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 15:10:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2025-03-17 15:10:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 97 states have internal predecessors, (115), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:10:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2025-03-17 15:10:25,649 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 28 [2025-03-17 15:10:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:25,650 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2025-03-17 15:10:25,650 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), 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-17 15:10:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2025-03-17 15:10:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:10:25,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:25,650 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:25,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:25,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:25,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:25,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1870940606, now seen corresponding path program 1 times [2025-03-17 15:10:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:25,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160013679] [2025-03-17 15:10:25,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:25,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:10:25,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:10:25,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:25,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:25,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459435785] [2025-03-17 15:10:25,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:25,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:25,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:25,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:25,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:10:25,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:10:25,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:10:25,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:25,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:25,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:10:25,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:10:25,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160013679] [2025-03-17 15:10:25,958 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459435785] [2025-03-17 15:10:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459435785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:25,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:25,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:10:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050946713] [2025-03-17 15:10:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:25,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:25,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:25,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:25,960 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-17 15:10:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:26,050 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2025-03-17 15:10:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:10:26,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 29 [2025-03-17 15:10:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:26,051 INFO L225 Difference]: With dead ends: 133 [2025-03-17 15:10:26,051 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 15:10:26,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:10:26,052 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 146 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:26,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 138 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 15:10:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2025-03-17 15:10:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.676923076923077) internal successors, (109), 94 states have internal predecessors, (109), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 15:10:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2025-03-17 15:10:26,066 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 29 [2025-03-17 15:10:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:26,066 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2025-03-17 15:10:26,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-17 15:10:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2025-03-17 15:10:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:10:26,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:26,066 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] [2025-03-17 15:10:26,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:26,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:26,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:26,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash 918350766, now seen corresponding path program 1 times [2025-03-17 15:10:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165148945] [2025-03-17 15:10:26,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:26,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:10:26,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:10:26,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:26,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:26,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438378615] [2025-03-17 15:10:26,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:26,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:26,285 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:26,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:10:26,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:10:26,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:10:26,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:26,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:26,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:10:26,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:26,341 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-17 15:10:26,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165148945] [2025-03-17 15:10:26,341 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438378615] [2025-03-17 15:10:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438378615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:10:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511861073] [2025-03-17 15:10:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:26,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:26,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:26,342 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:10:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:26,483 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2025-03-17 15:10:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:10:26,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 36 [2025-03-17 15:10:26,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:26,484 INFO L225 Difference]: With dead ends: 176 [2025-03-17 15:10:26,484 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 15:10:26,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:26,485 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 72 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:26,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 97 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 15:10:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2025-03-17 15:10:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.66) internal successors, (166), 129 states have internal predecessors, (166), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:10:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 212 transitions. [2025-03-17 15:10:26,503 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 212 transitions. Word has length 36 [2025-03-17 15:10:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:26,503 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 212 transitions. [2025-03-17 15:10:26,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:10:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 212 transitions. [2025-03-17 15:10:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 15:10:26,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:26,505 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] [2025-03-17 15:10:26,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:26,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:26,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1595897304, now seen corresponding path program 1 times [2025-03-17 15:10:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340219388] [2025-03-17 15:10:26,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:26,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:10:26,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:10:26,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:26,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104135574] [2025-03-17 15:10:26,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:26,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:26,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:26,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:26,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:10:26,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:10:26,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:10:26,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:26,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:26,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:10:26,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:26,791 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-17 15:10:26,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:26,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340219388] [2025-03-17 15:10:26,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104135574] [2025-03-17 15:10:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104135574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:10:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185406053] [2025-03-17 15:10:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:26,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:26,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:26,794 INFO L87 Difference]: Start difference. First operand 155 states and 212 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:10:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:26,912 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2025-03-17 15:10:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:10:26,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 37 [2025-03-17 15:10:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:26,913 INFO L225 Difference]: With dead ends: 174 [2025-03-17 15:10:26,914 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 15:10:26,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:26,914 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:26,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 97 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 15:10:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 156. [2025-03-17 15:10:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.613861386138614) internal successors, (163), 130 states have internal predecessors, (163), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:10:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 209 transitions. [2025-03-17 15:10:26,929 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 209 transitions. Word has length 37 [2025-03-17 15:10:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:26,929 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 209 transitions. [2025-03-17 15:10:26,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:10:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 209 transitions. [2025-03-17 15:10:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 15:10:26,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:26,932 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:26,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:10:27,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:27,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:27,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1913379445, now seen corresponding path program 1 times [2025-03-17 15:10:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954167331] [2025-03-17 15:10:27,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:27,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 15:10:27,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 15:10:27,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:27,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 15:10:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:27,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954167331] [2025-03-17 15:10:27,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954167331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:27,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:27,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:10:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001134768] [2025-03-17 15:10:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:27,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:27,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:27,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:27,235 INFO L87 Difference]: Start difference. First operand 156 states and 209 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:27,362 INFO L93 Difference]: Finished difference Result 189 states and 238 transitions. [2025-03-17 15:10:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:10:27,363 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), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2025-03-17 15:10:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:27,364 INFO L225 Difference]: With dead ends: 189 [2025-03-17 15:10:27,364 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 15:10:27,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:10:27,364 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 111 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:27,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 86 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 15:10:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2025-03-17 15:10:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.5825242718446602) internal successors, (163), 132 states have internal predecessors, (163), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:10:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 209 transitions. [2025-03-17 15:10:27,373 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 209 transitions. Word has length 57 [2025-03-17 15:10:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:27,373 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 209 transitions. [2025-03-17 15:10:27,373 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), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 209 transitions. [2025-03-17 15:10:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 15:10:27,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:27,374 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:10:27,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:27,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 814779356, now seen corresponding path program 1 times [2025-03-17 15:10:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703542665] [2025-03-17 15:10:27,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:27,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:10:27,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:10:27,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:27,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 15:10:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703542665] [2025-03-17 15:10:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703542665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:10:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583413997] [2025-03-17 15:10:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:27,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:27,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:27,456 INFO L87 Difference]: Start difference. First operand 158 states and 209 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:27,577 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2025-03-17 15:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:10:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2025-03-17 15:10:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:27,578 INFO L225 Difference]: With dead ends: 189 [2025-03-17 15:10:27,578 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 15:10:27,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:10:27,579 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 108 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:27,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 88 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 15:10:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 160. [2025-03-17 15:10:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.5523809523809524) internal successors, (163), 134 states have internal predecessors, (163), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:10:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2025-03-17 15:10:27,593 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 58 [2025-03-17 15:10:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:27,593 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2025-03-17 15:10:27,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2025-03-17 15:10:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 15:10:27,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:27,594 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:27,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:10:27,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:27,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1318913385, now seen corresponding path program 1 times [2025-03-17 15:10:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358012196] [2025-03-17 15:10:27,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:27,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:10:27,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:10:27,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:27,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 15:10:27,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:27,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358012196] [2025-03-17 15:10:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358012196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:10:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092157252] [2025-03-17 15:10:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:10:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:27,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:10:27,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:10:27,659 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:10:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:27,700 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2025-03-17 15:10:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:10:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2025-03-17 15:10:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:27,702 INFO L225 Difference]: With dead ends: 165 [2025-03-17 15:10:27,702 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 15:10:27,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:10:27,703 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:27,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:10:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 15:10:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-03-17 15:10:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.542857142857143) internal successors, (162), 134 states have internal predecessors, (162), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:10:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 208 transitions. [2025-03-17 15:10:27,712 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 208 transitions. Word has length 60 [2025-03-17 15:10:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:27,712 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 208 transitions. [2025-03-17 15:10:27,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:10:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 208 transitions. [2025-03-17 15:10:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 15:10:27,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:27,713 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:27,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:10:27,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1318913433, now seen corresponding path program 1 times [2025-03-17 15:10:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549452502] [2025-03-17 15:10:27,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:27,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:10:27,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:10:27,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:27,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 15:10:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549452502] [2025-03-17 15:10:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549452502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429890617] [2025-03-17 15:10:27,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:27,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:27,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:27,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:27,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:10:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:10:27,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:10:27,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:27,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:27,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:10:27,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 15:10:27,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429890617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 15:10:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535947024] [2025-03-17 15:10:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:10:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:27,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:10:27,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:10:27,893 INFO L87 Difference]: Start difference. First operand 160 states and 208 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:10:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:27,977 INFO L93 Difference]: Finished difference Result 160 states and 208 transitions. [2025-03-17 15:10:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:10:27,978 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2025-03-17 15:10:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:27,979 INFO L225 Difference]: With dead ends: 160 [2025-03-17 15:10:27,979 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 15:10:27,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:10:27,980 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:27,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 140 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 15:10:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-17 15:10:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 133 states have internal predecessors, (158), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:10:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2025-03-17 15:10:27,991 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 60 [2025-03-17 15:10:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:27,992 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 204 transitions. [2025-03-17 15:10:27,992 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, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:10:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2025-03-17 15:10:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:10:27,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:27,994 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:28,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:28,195 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,SelfDestructingSolverStorable10 [2025-03-17 15:10:28,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:28,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2063358041, now seen corresponding path program 1 times [2025-03-17 15:10:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:28,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121362221] [2025-03-17 15:10:28,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:28,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:10:28,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:10:28,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:28,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 15:10:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121362221] [2025-03-17 15:10:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121362221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:28,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:10:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554403268] [2025-03-17 15:10:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:28,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:10:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:28,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:10:28,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:10:28,251 INFO L87 Difference]: Start difference. First operand 159 states and 204 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:10:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:28,325 INFO L93 Difference]: Finished difference Result 159 states and 204 transitions. [2025-03-17 15:10:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:10:28,325 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2025-03-17 15:10:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:28,326 INFO L225 Difference]: With dead ends: 159 [2025-03-17 15:10:28,326 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 15:10:28,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-17 15:10:28,327 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 100 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:28,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 157 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 15:10:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-17 15:10:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 132 states have internal predecessors, (156), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:10:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2025-03-17 15:10:28,336 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 61 [2025-03-17 15:10:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:28,337 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2025-03-17 15:10:28,337 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:10:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2025-03-17 15:10:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:10:28,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:28,338 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:28,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:10:28,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:28,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2063356536, now seen corresponding path program 1 times [2025-03-17 15:10:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:28,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579629289] [2025-03-17 15:10:28,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:28,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:10:28,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:10:28,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:28,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 15:10:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579629289] [2025-03-17 15:10:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579629289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:28,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:10:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390172414] [2025-03-17 15:10:28,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:10:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:28,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:10:28,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:10:28,416 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:28,702 INFO L93 Difference]: Finished difference Result 208 states and 259 transitions. [2025-03-17 15:10:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:10:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2025-03-17 15:10:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:28,703 INFO L225 Difference]: With dead ends: 208 [2025-03-17 15:10:28,703 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 15:10:28,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:10:28,704 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 255 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:28,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 236 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:10:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 15:10:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 185. [2025-03-17 15:10:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 127 states have (on average 1.4724409448818898) internal successors, (187), 154 states have internal predecessors, (187), 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-17 15:10:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 243 transitions. [2025-03-17 15:10:28,715 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 243 transitions. Word has length 61 [2025-03-17 15:10:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:28,715 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 243 transitions. [2025-03-17 15:10:28,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2025-03-17 15:10:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:10:28,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:28,716 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:28,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:10:28,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 460410151, now seen corresponding path program 1 times [2025-03-17 15:10:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:28,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823989762] [2025-03-17 15:10:28,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:10:28,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:10:28,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:28,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 15:10:28,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823989762] [2025-03-17 15:10:28,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823989762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:28,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:28,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:10:28,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192790534] [2025-03-17 15:10:28,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:28,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:28,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:28,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:28,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:28,763 INFO L87 Difference]: Start difference. First operand 185 states and 243 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:28,911 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2025-03-17 15:10:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:10:28,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2025-03-17 15:10:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:28,913 INFO L225 Difference]: With dead ends: 206 [2025-03-17 15:10:28,913 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 15:10:28,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:28,913 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 40 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:28,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 15:10:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 189. [2025-03-17 15:10:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 158 states have internal predecessors, (191), 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-17 15:10:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2025-03-17 15:10:28,927 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 62 [2025-03-17 15:10:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:28,927 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2025-03-17 15:10:28,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:10:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2025-03-17 15:10:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 15:10:28,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:28,929 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:28,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:10:28,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:28,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1479238003, now seen corresponding path program 1 times [2025-03-17 15:10:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816367703] [2025-03-17 15:10:28,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:28,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:10:28,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:10:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516396034] [2025-03-17 15:10:28,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:28,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:28,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:28,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:10:28,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:10:28,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:10:28,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:28,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:28,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:10:28,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:10:29,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:29,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816367703] [2025-03-17 15:10:29,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516396034] [2025-03-17 15:10:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516396034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:29,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:29,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-17 15:10:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871782481] [2025-03-17 15:10:29,416 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:29,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:10:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:29,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:10:29,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:10:29,417 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:29,826 INFO L93 Difference]: Finished difference Result 280 states and 360 transitions. [2025-03-17 15:10:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:10:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 71 [2025-03-17 15:10:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:29,827 INFO L225 Difference]: With dead ends: 280 [2025-03-17 15:10:29,827 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 15:10:29,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:10:29,829 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 289 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:29,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 293 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 15:10:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 223. [2025-03-17 15:10:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 161 states have (on average 1.434782608695652) internal successors, (231), 187 states have internal predecessors, (231), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 15:10:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2025-03-17 15:10:29,844 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 71 [2025-03-17 15:10:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:29,844 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2025-03-17 15:10:29,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2025-03-17 15:10:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 15:10:29,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:29,845 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 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] [2025-03-17 15:10:29,851 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-17 15:10:30,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:10:30,049 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1388262127, now seen corresponding path program 1 times [2025-03-17 15:10:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853705022] [2025-03-17 15:10:30,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:30,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:10:30,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:10:30,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:30,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2979904] [2025-03-17 15:10:30,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:30,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:30,061 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:30,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 15:10:30,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:10:30,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:10:30,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:30,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:30,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:10:30,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:10:30,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853705022] [2025-03-17 15:10:30,589 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2979904] [2025-03-17 15:10:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2979904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:30,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:30,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-17 15:10:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028127092] [2025-03-17 15:10:30,589 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:30,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:10:30,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:30,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:10:30,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:10:30,590 INFO L87 Difference]: Start difference. First operand 223 states and 297 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:30,988 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2025-03-17 15:10:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:10:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 72 [2025-03-17 15:10:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:30,990 INFO L225 Difference]: With dead ends: 307 [2025-03-17 15:10:30,990 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 15:10:30,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:10:30,991 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 237 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:30,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 325 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 15:10:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 276. [2025-03-17 15:10:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 204 states have (on average 1.4215686274509804) internal successors, (290), 230 states have internal predecessors, (290), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 15:10:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 376 transitions. [2025-03-17 15:10:31,011 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 376 transitions. Word has length 72 [2025-03-17 15:10:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 376 transitions. [2025-03-17 15:10:31,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 376 transitions. [2025-03-17 15:10:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:10:31,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:31,013 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 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] [2025-03-17 15:10:31,018 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-17 15:10:31,213 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,SelfDestructingSolverStorable15 [2025-03-17 15:10:31,213 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:31,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash -86452943, now seen corresponding path program 1 times [2025-03-17 15:10:31,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:31,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577270320] [2025-03-17 15:10:31,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:31,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:10:31,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:10:31,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:31,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 15:10:31,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:31,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577270320] [2025-03-17 15:10:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577270320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:10:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284470260] [2025-03-17 15:10:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:31,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:10:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:31,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:10:31,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:10:31,269 INFO L87 Difference]: Start difference. First operand 276 states and 376 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 15:10:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:31,602 INFO L93 Difference]: Finished difference Result 403 states and 552 transitions. [2025-03-17 15:10:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:10:31,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2025-03-17 15:10:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:31,604 INFO L225 Difference]: With dead ends: 403 [2025-03-17 15:10:31,604 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 15:10:31,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:10:31,605 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 123 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:31,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 192 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 15:10:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 282. [2025-03-17 15:10:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 210 states have (on average 1.3857142857142857) internal successors, (291), 234 states have internal predecessors, (291), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 15:10:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 381 transitions. [2025-03-17 15:10:31,622 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 381 transitions. Word has length 73 [2025-03-17 15:10:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:31,622 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 381 transitions. [2025-03-17 15:10:31,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 15:10:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 381 transitions. [2025-03-17 15:10:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:10:31,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:31,623 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:31,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 15:10:31,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 953429600, now seen corresponding path program 1 times [2025-03-17 15:10:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:31,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26906205] [2025-03-17 15:10:31,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:31,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:10:31,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:10:31,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:31,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838248280] [2025-03-17 15:10:31,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:31,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:31,640 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:31,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 15:10:31,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:10:31,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:10:31,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:31,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:31,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:10:31,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:10:31,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:31,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:31,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26906205] [2025-03-17 15:10:31,895 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:31,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838248280] [2025-03-17 15:10:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838248280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:31,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:31,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-17 15:10:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559240201] [2025-03-17 15:10:31,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:31,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:10:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:31,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:10:31,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:10:31,896 INFO L87 Difference]: Start difference. First operand 282 states and 381 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:32,236 INFO L93 Difference]: Finished difference Result 322 states and 442 transitions. [2025-03-17 15:10:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:10:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 73 [2025-03-17 15:10:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:32,238 INFO L225 Difference]: With dead ends: 322 [2025-03-17 15:10:32,238 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 15:10:32,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:10:32,238 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 143 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:32,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 237 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 15:10:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 276. [2025-03-17 15:10:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 210 states have (on average 1.3142857142857143) internal successors, (276), 228 states have internal predecessors, (276), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 15:10:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 366 transitions. [2025-03-17 15:10:32,255 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 366 transitions. Word has length 73 [2025-03-17 15:10:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:32,255 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 366 transitions. [2025-03-17 15:10:32,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 366 transitions. [2025-03-17 15:10:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 15:10:32,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:32,256 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 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] [2025-03-17 15:10:32,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 15:10:32,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:10:32,457 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:32,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1614926095, now seen corresponding path program 1 times [2025-03-17 15:10:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:32,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635969290] [2025-03-17 15:10:32,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:32,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:10:32,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:10:32,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:32,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:10:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635969290] [2025-03-17 15:10:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635969290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937994446] [2025-03-17 15:10:32,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:32,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:32,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:32,564 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:32,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 15:10:32,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:10:32,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:10:32,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:32,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:32,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:10:32,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:10:32,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:10:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937994446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:10:32,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:10:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-17 15:10:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287037962] [2025-03-17 15:10:32,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:32,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 15:10:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:32,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 15:10:32,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:10:32,837 INFO L87 Difference]: Start difference. First operand 276 states and 366 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 5 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 15:10:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:33,330 INFO L93 Difference]: Finished difference Result 285 states and 373 transitions. [2025-03-17 15:10:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:10:33,331 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 5 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2025-03-17 15:10:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:33,332 INFO L225 Difference]: With dead ends: 285 [2025-03-17 15:10:33,332 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 15:10:33,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:10:33,333 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 178 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:33,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 356 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 15:10:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 219. [2025-03-17 15:10:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 167 states have (on average 1.251497005988024) internal successors, (209), 180 states have internal predecessors, (209), 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-17 15:10:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 281 transitions. [2025-03-17 15:10:33,350 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 281 transitions. Word has length 74 [2025-03-17 15:10:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:33,350 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 281 transitions. [2025-03-17 15:10:33,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 5 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 15:10:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 281 transitions. [2025-03-17 15:10:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 15:10:33,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:33,351 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:33,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:33,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:33,552 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:33,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:33,552 INFO L85 PathProgramCache]: Analyzing trace with hash -508453450, now seen corresponding path program 1 times [2025-03-17 15:10:33,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:33,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228843182] [2025-03-17 15:10:33,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:33,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:33,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:10:33,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:10:33,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:33,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076923985] [2025-03-17 15:10:33,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:33,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:33,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:33,566 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:33,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 15:10:33,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:10:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:10:33,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:33,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:33,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:10:33,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:10:33,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:33,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228843182] [2025-03-17 15:10:33,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:33,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076923985] [2025-03-17 15:10:33,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076923985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:33,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:33,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-17 15:10:33,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614215051] [2025-03-17 15:10:33,873 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:33,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:10:33,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:33,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:10:33,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:10:33,874 INFO L87 Difference]: Start difference. First operand 219 states and 281 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:34,261 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2025-03-17 15:10:34,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:10:34,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 74 [2025-03-17 15:10:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:34,263 INFO L225 Difference]: With dead ends: 465 [2025-03-17 15:10:34,264 INFO L226 Difference]: Without dead ends: 461 [2025-03-17 15:10:34,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:10:34,264 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 298 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:34,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 314 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-17 15:10:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 364. [2025-03-17 15:10:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 286 states have (on average 1.2412587412587412) internal successors, (355), 299 states have internal predecessors, (355), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 15:10:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2025-03-17 15:10:34,293 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 74 [2025-03-17 15:10:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:34,293 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2025-03-17 15:10:34,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:10:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2025-03-17 15:10:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 15:10:34,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:34,294 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:34,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:34,495 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,SelfDestructingSolverStorable19 [2025-03-17 15:10:34,495 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:34,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:34,495 INFO L85 PathProgramCache]: Analyzing trace with hash -681124594, now seen corresponding path program 1 times [2025-03-17 15:10:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:34,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183734989] [2025-03-17 15:10:34,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:34,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 15:10:34,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 15:10:34,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183734989] [2025-03-17 15:10:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183734989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284301218] [2025-03-17 15:10:34,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:34,559 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:34,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 15:10:34,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 15:10:34,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 15:10:34,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:34,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:34,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:10:34,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:34,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284301218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:10:34,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:10:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-17 15:10:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143203026] [2025-03-17 15:10:34,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:34,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:10:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:34,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:10:34,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:10:34,739 INFO L87 Difference]: Start difference. First operand 364 states and 479 transitions. Second operand has 11 states, 10 states have (on average 9.7) internal successors, (97), 11 states have internal predecessors, (97), 10 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-17 15:10:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:35,146 INFO L93 Difference]: Finished difference Result 575 states and 756 transitions. [2025-03-17 15:10:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:10:35,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.7) internal successors, (97), 11 states have internal predecessors, (97), 10 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) Word has length 95 [2025-03-17 15:10:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:35,149 INFO L225 Difference]: With dead ends: 575 [2025-03-17 15:10:35,149 INFO L226 Difference]: Without dead ends: 573 [2025-03-17 15:10:35,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:10:35,150 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 553 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:35,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 328 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-17 15:10:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 469. [2025-03-17 15:10:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 370 states have (on average 1.2243243243243243) internal successors, (453), 382 states have internal predecessors, (453), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 15:10:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 621 transitions. [2025-03-17 15:10:35,183 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 621 transitions. Word has length 95 [2025-03-17 15:10:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:35,185 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 621 transitions. [2025-03-17 15:10:35,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.7) internal successors, (97), 11 states have internal predecessors, (97), 10 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-17 15:10:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 621 transitions. [2025-03-17 15:10:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 15:10:35,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:35,186 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:35,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 15:10:35,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:35,390 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:35,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1725705701, now seen corresponding path program 1 times [2025-03-17 15:10:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465697764] [2025-03-17 15:10:35,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:35,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 15:10:35,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 15:10:35,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:35,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465697764] [2025-03-17 15:10:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465697764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:35,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:35,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:10:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731474852] [2025-03-17 15:10:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:35,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:10:35,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:35,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:10:35,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:10:35,429 INFO L87 Difference]: Start difference. First operand 469 states and 621 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 15:10:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:35,482 INFO L93 Difference]: Finished difference Result 469 states and 621 transitions. [2025-03-17 15:10:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:10:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2025-03-17 15:10:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:35,484 INFO L225 Difference]: With dead ends: 469 [2025-03-17 15:10:35,485 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 15:10:35,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:10:35,487 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:35,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:10:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 15:10:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-17 15:10:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 370 states have (on average 1.2135135135135136) internal successors, (449), 381 states have internal predecessors, (449), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 15:10:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 617 transitions. [2025-03-17 15:10:35,522 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 617 transitions. Word has length 97 [2025-03-17 15:10:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:35,522 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 617 transitions. [2025-03-17 15:10:35,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 15:10:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 617 transitions. [2025-03-17 15:10:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 15:10:35,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:35,524 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:35,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 15:10:35,525 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:35,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:35,525 INFO L85 PathProgramCache]: Analyzing trace with hash -545802919, now seen corresponding path program 1 times [2025-03-17 15:10:35,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:35,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462166716] [2025-03-17 15:10:35,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:35,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:35,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 15:10:35,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 15:10:35,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:35,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462166716] [2025-03-17 15:10:35,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462166716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885361400] [2025-03-17 15:10:35,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:35,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:35,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:35,602 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:35,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 15:10:35,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 15:10:35,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 15:10:35,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:35,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:35,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:10:35,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:35,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:10:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885361400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-17 15:10:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673515262] [2025-03-17 15:10:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:35,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:10:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:35,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:10:35,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:10:35,732 INFO L87 Difference]: Start difference. First operand 468 states and 617 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 15:10:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:35,838 INFO L93 Difference]: Finished difference Result 481 states and 636 transitions. [2025-03-17 15:10:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:10:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 99 [2025-03-17 15:10:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:35,840 INFO L225 Difference]: With dead ends: 481 [2025-03-17 15:10:35,840 INFO L226 Difference]: Without dead ends: 480 [2025-03-17 15:10:35,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:10:35,841 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:35,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 104 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-17 15:10:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 467. [2025-03-17 15:10:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 370 states have (on average 1.2027027027027026) internal successors, (445), 380 states have internal predecessors, (445), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 15:10:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 613 transitions. [2025-03-17 15:10:35,872 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 613 transitions. Word has length 99 [2025-03-17 15:10:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:35,873 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 613 transitions. [2025-03-17 15:10:35,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 15:10:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 613 transitions. [2025-03-17 15:10:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 15:10:35,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:35,874 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:35,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:36,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:36,074 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:36,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:36,075 INFO L85 PathProgramCache]: Analyzing trace with hash 259978675, now seen corresponding path program 1 times [2025-03-17 15:10:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:36,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088458972] [2025-03-17 15:10:36,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:36,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 15:10:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:10:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:36,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:36,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088458972] [2025-03-17 15:10:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088458972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000273655] [2025-03-17 15:10:36,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:36,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:36,130 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:36,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 15:10:36,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 15:10:36,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:10:36,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:36,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:36,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:10:36,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:36,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 15:10:36,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000273655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:10:36,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:10:36,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 15:10:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038394208] [2025-03-17 15:10:36,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:36,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:10:36,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:36,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:10:36,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:10:36,389 INFO L87 Difference]: Start difference. First operand 467 states and 613 transitions. Second operand has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 10 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-17 15:10:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:36,720 INFO L93 Difference]: Finished difference Result 824 states and 1088 transitions. [2025-03-17 15:10:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:10:36,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 10 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) Word has length 100 [2025-03-17 15:10:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:36,724 INFO L225 Difference]: With dead ends: 824 [2025-03-17 15:10:36,724 INFO L226 Difference]: Without dead ends: 822 [2025-03-17 15:10:36,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:10:36,725 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 198 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:36,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 283 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:10:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-17 15:10:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 641. [2025-03-17 15:10:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 514 states have (on average 1.1906614785992218) internal successors, (612), 524 states have internal predecessors, (612), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 15:10:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 840 transitions. [2025-03-17 15:10:36,785 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 840 transitions. Word has length 100 [2025-03-17 15:10:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:36,785 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 840 transitions. [2025-03-17 15:10:36,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 10 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-17 15:10:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 840 transitions. [2025-03-17 15:10:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 15:10:36,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:36,787 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:36,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:36,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 15:10:36,987 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1194463617, now seen corresponding path program 1 times [2025-03-17 15:10:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734377758] [2025-03-17 15:10:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:36,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 15:10:37,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 15:10:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:37,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381606215] [2025-03-17 15:10:37,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:37,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:37,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:37,009 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:37,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 15:10:37,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 15:10:37,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 15:10:37,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:37,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:37,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:10:37,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 15:10:37,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734377758] [2025-03-17 15:10:37,521 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381606215] [2025-03-17 15:10:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381606215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:37,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-17 15:10:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678244810] [2025-03-17 15:10:37,521 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:37,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:10:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:37,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:10:37,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:10:37,523 INFO L87 Difference]: Start difference. First operand 641 states and 840 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 15:10:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:38,096 INFO L93 Difference]: Finished difference Result 718 states and 935 transitions. [2025-03-17 15:10:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 15:10:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 108 [2025-03-17 15:10:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:38,099 INFO L225 Difference]: With dead ends: 718 [2025-03-17 15:10:38,099 INFO L226 Difference]: Without dead ends: 714 [2025-03-17 15:10:38,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:10:38,100 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 165 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:38,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 430 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:10:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-17 15:10:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 703. [2025-03-17 15:10:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 564 states have (on average 1.1843971631205674) internal successors, (668), 574 states have internal predecessors, (668), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 15:10:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 920 transitions. [2025-03-17 15:10:38,150 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 920 transitions. Word has length 108 [2025-03-17 15:10:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:38,151 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 920 transitions. [2025-03-17 15:10:38,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 15:10:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 920 transitions. [2025-03-17 15:10:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 15:10:38,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:38,155 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:38,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 15:10:38,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:38,355 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:38,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1626333501, now seen corresponding path program 1 times [2025-03-17 15:10:38,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:38,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688458661] [2025-03-17 15:10:38,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:38,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 15:10:38,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 15:10:38,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:38,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:10:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482828854] [2025-03-17 15:10:38,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:38,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:38,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:38,368 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:38,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 15:10:38,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 15:10:38,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 15:10:38,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:38,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:38,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:10:38,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 15:10:38,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:38,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688458661] [2025-03-17 15:10:38,945 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:10:38,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482828854] [2025-03-17 15:10:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482828854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:38,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:10:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-17 15:10:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215914359] [2025-03-17 15:10:38,945 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:10:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:38,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:10:38,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:10:38,945 INFO L87 Difference]: Start difference. First operand 703 states and 920 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 15:10:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:39,376 INFO L93 Difference]: Finished difference Result 715 states and 927 transitions. [2025-03-17 15:10:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:10:39,377 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 109 [2025-03-17 15:10:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:39,379 INFO L225 Difference]: With dead ends: 715 [2025-03-17 15:10:39,379 INFO L226 Difference]: Without dead ends: 714 [2025-03-17 15:10:39,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:10:39,380 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 163 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:39,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 334 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:10:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-17 15:10:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 703. [2025-03-17 15:10:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 564 states have (on average 1.1826241134751774) internal successors, (667), 574 states have internal predecessors, (667), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 15:10:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 919 transitions. [2025-03-17 15:10:39,433 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 919 transitions. Word has length 109 [2025-03-17 15:10:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:39,433 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 919 transitions. [2025-03-17 15:10:39,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 15:10:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 919 transitions. [2025-03-17 15:10:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 15:10:39,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:39,435 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:39,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 15:10:39,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:39,639 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1123269055, now seen corresponding path program 1 times [2025-03-17 15:10:39,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:39,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468398142] [2025-03-17 15:10:39,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:10:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:39,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 15:10:39,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 15:10:39,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:10:39,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-17 15:10:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:39,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468398142] [2025-03-17 15:10:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468398142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:39,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:10:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642389860] [2025-03-17 15:10:39,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:10:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:39,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:10:39,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:10:39,708 INFO L87 Difference]: Start difference. First operand 703 states and 919 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 15:10:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:40,025 INFO L93 Difference]: Finished difference Result 706 states and 919 transitions. [2025-03-17 15:10:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:10:40,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 110 [2025-03-17 15:10:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:40,028 INFO L225 Difference]: With dead ends: 706 [2025-03-17 15:10:40,029 INFO L226 Difference]: Without dead ends: 705 [2025-03-17 15:10:40,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:10:40,030 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 72 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:40,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 192 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:10:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-17 15:10:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 666. [2025-03-17 15:10:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 532 states have (on average 1.1672932330827068) internal successors, (621), 541 states have internal predecessors, (621), 122 states have call successors, (122), 2 states have call predecessors, (122), 2 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-17 15:10:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 865 transitions. [2025-03-17 15:10:40,075 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 865 transitions. Word has length 110 [2025-03-17 15:10:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:40,076 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 865 transitions. [2025-03-17 15:10:40,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 15:10:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 865 transitions. [2025-03-17 15:10:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 15:10:40,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:40,077 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:40,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 15:10:40,077 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1661777176, now seen corresponding path program 2 times [2025-03-17 15:10:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:40,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870699342] [2025-03-17 15:10:40,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:10:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:40,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-03-17 15:10:40,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 15:10:40,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:10:40,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 15:10:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870699342] [2025-03-17 15:10:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870699342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911887696] [2025-03-17 15:10:40,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:10:40,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:40,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:40,229 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:40,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 15:10:40,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-03-17 15:10:40,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 15:10:40,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:10:40,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:40,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:10:40,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-17 15:10:40,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-17 15:10:40,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911887696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:10:40,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:10:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-17 15:10:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924330646] [2025-03-17 15:10:40,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 15:10:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:40,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 15:10:40,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:10:40,608 INFO L87 Difference]: Start difference. First operand 666 states and 865 transitions. Second operand has 20 states, 20 states have (on average 6.5) internal successors, (130), 17 states have internal predecessors, (130), 14 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (38), 16 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-17 15:10:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:40,833 INFO L93 Difference]: Finished difference Result 716 states and 914 transitions. [2025-03-17 15:10:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:10:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.5) internal successors, (130), 17 states have internal predecessors, (130), 14 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (38), 16 states have call predecessors, (38), 14 states have call successors, (38) Word has length 111 [2025-03-17 15:10:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:40,835 INFO L225 Difference]: With dead ends: 716 [2025-03-17 15:10:40,835 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 15:10:40,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:10:40,836 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 195 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:40,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 281 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 15:10:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 254. [2025-03-17 15:10:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.065326633165829) internal successors, (212), 203 states have internal predecessors, (212), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 15:10:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 308 transitions. [2025-03-17 15:10:40,855 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 308 transitions. Word has length 111 [2025-03-17 15:10:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:40,855 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 308 transitions. [2025-03-17 15:10:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.5) internal successors, (130), 17 states have internal predecessors, (130), 14 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (38), 16 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-17 15:10:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 308 transitions. [2025-03-17 15:10:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 15:10:40,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:40,856 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:40,861 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-17 15:10:41,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:41,057 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:41,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash -524141280, now seen corresponding path program 2 times [2025-03-17 15:10:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:41,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839863517] [2025-03-17 15:10:41,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:10:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:41,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-17 15:10:41,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 15:10:41,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:10:41,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-17 15:10:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839863517] [2025-03-17 15:10:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839863517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:10:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:10:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:10:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676256357] [2025-03-17 15:10:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:10:41,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:10:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:41,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:10:41,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:10:41,118 INFO L87 Difference]: Start difference. First operand 254 states and 308 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 15:10:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:41,217 INFO L93 Difference]: Finished difference Result 329 states and 398 transitions. [2025-03-17 15:10:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:10:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 117 [2025-03-17 15:10:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:41,218 INFO L225 Difference]: With dead ends: 329 [2025-03-17 15:10:41,218 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 15:10:41,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:10:41,219 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:41,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 125 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:10:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 15:10:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2025-03-17 15:10:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.0808823529411764) internal successors, (147), 140 states have internal predecessors, (147), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 15:10:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2025-03-17 15:10:41,231 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 117 [2025-03-17 15:10:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:41,231 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2025-03-17 15:10:41,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 15:10:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2025-03-17 15:10:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 15:10:41,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:10:41,232 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:10:41,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 15:10:41,233 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-03-17 15:10:41,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:10:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 811942454, now seen corresponding path program 2 times [2025-03-17 15:10:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:10:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714290610] [2025-03-17 15:10:41,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:10:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:10:41,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 153 statements into 2 equivalence classes. [2025-03-17 15:10:41,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 15:10:41,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:10:41,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 15:10:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:10:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714290610] [2025-03-17 15:10:41,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714290610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:10:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304144288] [2025-03-17 15:10:41,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:10:41,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:41,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:10:41,362 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:10:41,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-17 15:10:41,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 153 statements into 2 equivalence classes. [2025-03-17 15:10:41,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 15:10:41,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:10:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:10:41,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:10:41,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:10:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 221 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-17 15:10:41,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:10:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-17 15:10:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304144288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:10:41,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:10:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-17 15:10:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211768404] [2025-03-17 15:10:41,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:10:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:10:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:10:41,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:10:41,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:10:41,856 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 14 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (43), 13 states have call predecessors, (43), 14 states have call successors, (43) [2025-03-17 15:10:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:10:42,058 INFO L93 Difference]: Finished difference Result 179 states and 214 transitions. [2025-03-17 15:10:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:10:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 14 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (43), 13 states have call predecessors, (43), 14 states have call successors, (43) Word has length 153 [2025-03-17 15:10:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:10:42,059 INFO L225 Difference]: With dead ends: 179 [2025-03-17 15:10:42,059 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:10:42,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 294 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:10:42,060 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 104 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:10:42,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 265 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:10:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:10:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:10:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:10:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:10:42,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2025-03-17 15:10:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:10:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:10:42,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 14 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (43), 13 states have call predecessors, (43), 14 states have call successors, (43) [2025-03-17 15:10:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:10:42,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2025-03-17 15:10:42,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2025-03-17 15:10:42,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2025-03-17 15:10:42,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-17 15:10:42,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:10:42,267 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-17 15:10:42,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:10:43,532 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:10:43,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:10:43 BoogieIcfgContainer [2025-03-17 15:10:43,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:10:43,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:10:43,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:10:43,542 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:10:43,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:24" (3/4) ... [2025-03-17 15:10:43,544 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:10:43,549 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 15:10:43,549 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:10:43,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 15:10:43,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:10:43,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:10:43,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:10:43,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:10:43,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:10:43,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:10:43,612 INFO L158 Benchmark]: Toolchain (without parser) took 20111.19ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.3MB in the beginning and 193.3MB in the end (delta: -87.9MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2025-03-17 15:10:43,612 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:10:43,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.36ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:10:43,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:10:43,613 INFO L158 Benchmark]: Boogie Preprocessor took 31.27ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 92.7MB in the end (delta: 371.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:10:43,613 INFO L158 Benchmark]: IcfgBuilder took 304.08ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 76.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:10:43,613 INFO L158 Benchmark]: TraceAbstraction took 19521.36ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 76.4MB in the beginning and 201.3MB in the end (delta: -124.9MB). Peak memory consumption was 169.8MB. Max. memory is 16.1GB. [2025-03-17 15:10:43,613 INFO L158 Benchmark]: Witness Printer took 69.46ms. Allocated memory is still 343.9MB. Free memory was 201.3MB in the beginning and 193.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:10:43,614 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.41ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.36ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.27ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 92.7MB in the end (delta: 371.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 304.08ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 76.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19521.36ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 76.4MB in the beginning and 201.3MB in the end (delta: -124.9MB). Peak memory consumption was 169.8MB. Max. memory is 16.1GB. * Witness Printer took 69.46ms. Allocated memory is still 343.9MB. Free memory was 201.3MB in the beginning and 193.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 86 locations, 109 edges, 30 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 30, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4061 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3950 mSDsluCounter, 6046 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4233 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7280 IncrementalHoareTripleChecker+Invalid, 7870 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 1813 mSDtfsCounter, 7280 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2189 GetRequests, 1894 SyntacticMatches, 7 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=25, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 983 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 3542 NumberOfCodeBlocks, 3542 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3377 ConstructedInterpolants, 0 QuantifiedInterpolants, 11127 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2825 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 44 InterpolantComputations, 19 PerfectInterpolantSequences, 5372/5668 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (((((((((0 <= x) && (b == y)) && (r <= 2)) && (a == 1)) && (1 <= b)) && (q == 0)) && (y <= r)) && (x <= 2)) || (((((((0 <= x) && (q == 0)) && (y == 1)) && (2 == b)) && (2 == a)) && (2 == r)) && (x <= 2))) - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((((((((((((0 <= x) && (1 <= y)) && (b <= 1073741823)) && (r <= 2)) && (q == 0)) && (a == 0)) && (0 <= ((__int128) b + 2147483648))) && (y <= 2147483647)) && (x <= 2)) && (0 <= ((__int128) r + 2147483648))) || ((((((((0 <= x) && (y <= 2)) && (b == y)) && (a == 1)) && (1 <= b)) && (r == 0)) && (q == 1)) && (x <= 2))) || (((((((0 <= x) && (r == 0)) && (y == 1)) && (2 == q)) && (2 == b)) && (2 == a)) && (x <= 2))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:10:43,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE