./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound10.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/lcm1_unwindbound10.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 357c28cbcf8a6aaf949faeabbb5ae0b19b92db6bb2faeba12cd91e7c958ae977 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:29:48,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:29:48,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:29:48,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:29:48,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:29:48,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:29:48,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:29:48,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:29:48,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:29:48,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:29:48,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:29:48,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:29:48,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:29:48,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:29:48,196 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:29:48,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:29:48,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:29:48,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:29:48,197 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:29:48,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:29:48,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:29:48,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:29:48,198 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 -> 357c28cbcf8a6aaf949faeabbb5ae0b19b92db6bb2faeba12cd91e7c958ae977 [2025-03-17 15:29:48,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:29:48,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:29:48,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:29:48,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:29:48,475 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:29:48,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound10.c [2025-03-17 15:29:49,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99325389f/483f82228f0b4dceae88b014e0701b49/FLAG4be412855 [2025-03-17 15:29:49,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:29:49,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound10.c [2025-03-17 15:29:49,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99325389f/483f82228f0b4dceae88b014e0701b49/FLAG4be412855 [2025-03-17 15:29:50,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99325389f/483f82228f0b4dceae88b014e0701b49 [2025-03-17 15:29:50,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:29:50,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:29:50,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:29:50,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:29:50,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:29:50,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c75fcdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50, skipping insertion in model container [2025-03-17 15:29:50,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:29:50,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:29:50,171 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:29:50,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:29:50,204 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:29:50,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50 WrapperNode [2025-03-17 15:29:50,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:29:50,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:29:50,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:29:50,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:29:50,211 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:29:50" (1/1) ... [2025-03-17 15:29:50,221 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:29:50" (1/1) ... [2025-03-17 15:29:50,239 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-17 15:29:50,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:29:50,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:29:50,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:29:50,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:29:50,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,264 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-17 15:29:50,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:29:50,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:29:50,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:29:50,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:29:50,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (1/1) ... [2025-03-17 15:29:50,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:29:50,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:50,308 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:29:50,310 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:29:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:29:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:29:50,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:29:50,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:29:50,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:29:50,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:29:50,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:29:50,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:29:50,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:29:50,383 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:29:50,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:29:50,595 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 15:29:50,596 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:29:50,608 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:29:50,608 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:29:50,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:29:50 BoogieIcfgContainer [2025-03-17 15:29:50,609 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:29:50,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:29:50,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:29:50,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:29:50,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:29:50" (1/3) ... [2025-03-17 15:29:50,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfed590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:29:50, skipping insertion in model container [2025-03-17 15:29:50,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:50" (2/3) ... [2025-03-17 15:29:50,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfed590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:29:50, skipping insertion in model container [2025-03-17 15:29:50,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:29:50" (3/3) ... [2025-03-17 15:29:50,619 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound10.c [2025-03-17 15:29:50,632 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:29:50,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound10.c that has 3 procedures, 43 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-17 15:29:50,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:29:50,695 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;@424869b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:29:50,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 15:29:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.68) internal successors, (42), 31 states have internal predecessors, (42), 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:29:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:29:50,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:50,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:50,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:50,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1517090083, now seen corresponding path program 1 times [2025-03-17 15:29:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100483052] [2025-03-17 15:29:50,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:29:50,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:29:50,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100483052] [2025-03-17 15:29:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100483052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:29:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592407248] [2025-03-17 15:29:50,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:50,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:29:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:50,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:29:50,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:29:50,996 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.68) internal successors, (42), 31 states have internal predecessors, (42), 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:29:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:51,071 INFO L93 Difference]: Finished difference Result 88 states and 134 transitions. [2025-03-17 15:29:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:29:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2025-03-17 15:29:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:51,077 INFO L225 Difference]: With dead ends: 88 [2025-03-17 15:29:51,077 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 15:29:51,079 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:29:51,083 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:51,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:29:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 15:29:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-17 15:29:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:29:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-17 15:29:51,112 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2025-03-17 15:29:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:51,113 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-17 15:29:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:29:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-17 15:29:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:29:51,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:51,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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:29:51,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:29:51,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:51,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1022088843, now seen corresponding path program 1 times [2025-03-17 15:29:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:51,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628975092] [2025-03-17 15:29:51,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:51,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:29:51,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:29:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628975092] [2025-03-17 15:29:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628975092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:51,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:51,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:29:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757215962] [2025-03-17 15:29:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:51,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:29:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:51,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:29:51,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:29:51,327 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:29:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:51,437 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-03-17 15:29:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:29:51,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 34 [2025-03-17 15:29:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:51,438 INFO L225 Difference]: With dead ends: 61 [2025-03-17 15:29:51,438 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 15:29:51,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:29:51,439 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:51,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 153 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:29:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 15:29:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-03-17 15:29:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:29:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-03-17 15:29:51,449 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 34 [2025-03-17 15:29:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:51,450 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-03-17 15:29:51,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:29:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-03-17 15:29:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:29:51,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:51,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:51,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:29:51,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:51,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1619983068, now seen corresponding path program 1 times [2025-03-17 15:29:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096020878] [2025-03-17 15:29:51,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:51,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:29:51,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:29:51,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:51,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:51,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096020878] [2025-03-17 15:29:51,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096020878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:51,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:51,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:29:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41156451] [2025-03-17 15:29:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:51,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:29:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:51,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:29:51,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:29:51,605 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:29:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:51,697 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2025-03-17 15:29:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:29:51,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 35 [2025-03-17 15:29:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:51,700 INFO L225 Difference]: With dead ends: 90 [2025-03-17 15:29:51,701 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 15:29:51,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:29:51,701 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:51,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 160 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:29:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 15:29:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 15:29:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:29:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-03-17 15:29:51,715 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 35 [2025-03-17 15:29:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:51,715 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-03-17 15:29:51,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:29:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-03-17 15:29:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:29:51,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:51,716 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:51,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:29:51,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:51,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1051691262, now seen corresponding path program 1 times [2025-03-17 15:29:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:51,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931307324] [2025-03-17 15:29:51,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:51,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:29:51,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:29:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:29:51,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931307324] [2025-03-17 15:29:51,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931307324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:51,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:51,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:29:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973104105] [2025-03-17 15:29:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:29:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:51,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:29:51,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:29:51,867 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:29:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:52,088 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-03-17 15:29:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:29:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2025-03-17 15:29:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:52,090 INFO L225 Difference]: With dead ends: 80 [2025-03-17 15:29:52,090 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 15:29:52,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:29:52,090 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 40 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:52,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 209 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:29:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 15:29:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2025-03-17 15:29:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:29:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2025-03-17 15:29:52,100 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 44 [2025-03-17 15:29:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2025-03-17 15:29:52,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:29:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2025-03-17 15:29:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 15:29:52,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:52,102 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:29:52,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1757309266, now seen corresponding path program 1 times [2025-03-17 15:29:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713046318] [2025-03-17 15:29:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:29:52,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:29:52,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:52,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:29:52,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:52,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713046318] [2025-03-17 15:29:52,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713046318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:52,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:29:52,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499560550] [2025-03-17 15:29:52,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:52,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:29:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:52,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:29:52,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:29:52,212 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:29:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:52,395 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2025-03-17 15:29:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:29:52,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-03-17 15:29:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:52,397 INFO L225 Difference]: With dead ends: 114 [2025-03-17 15:29:52,397 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 15:29:52,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:29:52,398 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:52,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 198 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:29:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 15:29:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-17 15:29:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 64 states have internal predecessors, (76), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 15:29:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-03-17 15:29:52,413 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 45 [2025-03-17 15:29:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:52,413 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-03-17 15:29:52,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:29:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2025-03-17 15:29:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 15:29:52,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:52,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:52,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:29:52,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1757236775, now seen corresponding path program 1 times [2025-03-17 15:29:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595418314] [2025-03-17 15:29:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:52,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:29:52,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:29:52,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:29:52,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:52,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595418314] [2025-03-17 15:29:52,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595418314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:29:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191120412] [2025-03-17 15:29:52,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:52,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:52,516 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:29:52,517 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:29:52,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:29:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:29:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:52,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:29:52,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:29:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:52,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:29:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:29:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191120412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:29:52,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:29:52,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-17 15:29:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137045295] [2025-03-17 15:29:52,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:29:52,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:29:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:52,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:29:52,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:29:52,781 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:29:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:53,285 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2025-03-17 15:29:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:29:53,287 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 45 [2025-03-17 15:29:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:53,288 INFO L225 Difference]: With dead ends: 232 [2025-03-17 15:29:53,288 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 15:29:53,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2025-03-17 15:29:53,290 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 175 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:53,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 224 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:29:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 15:29:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2025-03-17 15:29:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 129 states have internal predecessors, (158), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 15:29:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2025-03-17 15:29:53,311 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 45 [2025-03-17 15:29:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:53,311 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2025-03-17 15:29:53,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:29:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2025-03-17 15:29:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 15:29:53,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:53,312 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-17 15:29:53,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:29:53,513 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,SelfDestructingSolverStorable5 [2025-03-17 15:29:53,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:53,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 38535006, now seen corresponding path program 1 times [2025-03-17 15:29:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:53,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062273361] [2025-03-17 15:29:53,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:53,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 15:29:53,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 15:29:53,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:53,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:29:53,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:53,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062273361] [2025-03-17 15:29:53,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062273361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:29:53,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397218939] [2025-03-17 15:29:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:53,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:29:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:53,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:29:53,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:29:53,577 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:29:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:53,647 INFO L93 Difference]: Finished difference Result 269 states and 328 transitions. [2025-03-17 15:29:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:29:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2025-03-17 15:29:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:53,649 INFO L225 Difference]: With dead ends: 269 [2025-03-17 15:29:53,649 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 15:29:53,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:29:53,650 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:53,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:29:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 15:29:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2025-03-17 15:29:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 140 states have (on average 1.292857142857143) internal successors, (181), 145 states have internal predecessors, (181), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 15:29:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 225 transitions. [2025-03-17 15:29:53,677 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 225 transitions. Word has length 54 [2025-03-17 15:29:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:53,677 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 225 transitions. [2025-03-17 15:29:53,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:29:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2025-03-17 15:29:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:29:53,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:53,679 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:53,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:29:53,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:53,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1194620940, now seen corresponding path program 1 times [2025-03-17 15:29:53,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:53,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9089129] [2025-03-17 15:29:53,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:53,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:29:53,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:29:53,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:53,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:29:53,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9089129] [2025-03-17 15:29:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9089129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:29:53,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962009058] [2025-03-17 15:29:53,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:53,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:53,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:53,838 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:29:53,841 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:29:53,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:29:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:29:53,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:53,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:53,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:29:53,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:29:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:53,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:29:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:29:54,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962009058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:29:54,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:29:54,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-17 15:29:54,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989394946] [2025-03-17 15:29:54,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:29:54,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 15:29:54,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:54,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 15:29:54,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:29:54,160 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 15:29:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:54,984 INFO L93 Difference]: Finished difference Result 378 states and 472 transitions. [2025-03-17 15:29:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-17 15:29:54,985 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 55 [2025-03-17 15:29:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:54,987 INFO L225 Difference]: With dead ends: 378 [2025-03-17 15:29:54,987 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 15:29:54,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 15:29:54,989 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 179 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:54,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 238 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:29:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 15:29:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 262. [2025-03-17 15:29:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 205 states have (on average 1.278048780487805) internal successors, (262), 210 states have internal predecessors, (262), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:29:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 320 transitions. [2025-03-17 15:29:55,009 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 320 transitions. Word has length 55 [2025-03-17 15:29:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:55,009 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 320 transitions. [2025-03-17 15:29:55,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 15:29:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2025-03-17 15:29:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 15:29:55,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:55,010 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-17 15:29:55,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:29:55,211 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,SelfDestructingSolverStorable7 [2025-03-17 15:29:55,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:55,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1833773530, now seen corresponding path program 1 times [2025-03-17 15:29:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:55,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276140338] [2025-03-17 15:29:55,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:55,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:29:55,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:29:55,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:55,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:29:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276140338] [2025-03-17 15:29:55,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276140338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:29:55,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037020189] [2025-03-17 15:29:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:55,339 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:29:55,341 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:29:55,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:29:55,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:29:55,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:55,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:55,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:29:55,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:29:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:55,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:29:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:29:55,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037020189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:29:55,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:29:55,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2025-03-17 15:29:55,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475408966] [2025-03-17 15:29:55,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:29:55,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:29:55,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:55,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:29:55,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:29:55,588 INFO L87 Difference]: Start difference. First operand 262 states and 320 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-17 15:29:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:56,064 INFO L93 Difference]: Finished difference Result 470 states and 580 transitions. [2025-03-17 15:29:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 15:29:56,064 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Word has length 58 [2025-03-17 15:29:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:56,067 INFO L225 Difference]: With dead ends: 470 [2025-03-17 15:29:56,067 INFO L226 Difference]: Without dead ends: 331 [2025-03-17 15:29:56,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 15:29:56,069 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 110 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:56,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 328 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:29:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-17 15:29:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 322. [2025-03-17 15:29:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 257 states have (on average 1.245136186770428) internal successors, (320), 262 states have internal predecessors, (320), 33 states have call successors, (33), 26 states have call predecessors, (33), 26 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 15:29:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 386 transitions. [2025-03-17 15:29:56,086 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 386 transitions. Word has length 58 [2025-03-17 15:29:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:56,087 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 386 transitions. [2025-03-17 15:29:56,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-17 15:29:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 386 transitions. [2025-03-17 15:29:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 15:29:56,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:56,089 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2025-03-17 15:29:56,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:29:56,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:56,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:56,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1644021696, now seen corresponding path program 1 times [2025-03-17 15:29:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050094342] [2025-03-17 15:29:56,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:56,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:29:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:29:56,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:56,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 15:29:56,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050094342] [2025-03-17 15:29:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050094342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:29:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043637582] [2025-03-17 15:29:56,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:56,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:56,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:56,443 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:29:56,445 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:29:56,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:29:56,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:29:56,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:56,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:56,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:29:56,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:29:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:56,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:29:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043637582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:56,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:29:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-17 15:29:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273788000] [2025-03-17 15:29:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:29:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:56,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:29:56,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:29:56,607 INFO L87 Difference]: Start difference. First operand 322 states and 386 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 15:29:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:56,904 INFO L93 Difference]: Finished difference Result 390 states and 468 transitions. [2025-03-17 15:29:56,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:29:56,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 64 [2025-03-17 15:29:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:56,906 INFO L225 Difference]: With dead ends: 390 [2025-03-17 15:29:56,907 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 15:29:56,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:29:56,908 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 73 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:56,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 190 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:29:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 15:29:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 292. [2025-03-17 15:29:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.1630901287553648) internal successors, (271), 236 states have internal predecessors, (271), 31 states have call successors, (31), 25 states have call predecessors, (31), 25 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 15:29:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 333 transitions. [2025-03-17 15:29:56,923 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 333 transitions. Word has length 64 [2025-03-17 15:29:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:56,924 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 333 transitions. [2025-03-17 15:29:56,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 15:29:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2025-03-17 15:29:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:29:56,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:56,925 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2025-03-17 15:29:56,931 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:29:57,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:57,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -574934972, now seen corresponding path program 1 times [2025-03-17 15:29:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633655665] [2025-03-17 15:29:57,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:57,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:29:57,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:29:57,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:57,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 15:29:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633655665] [2025-03-17 15:29:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633655665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:29:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613494773] [2025-03-17 15:29:57,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:57,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:57,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:57,275 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:29:57,277 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:29:57,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:29:57,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:29:57,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:57,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:57,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:29:57,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:29:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:57,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:29:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 15:29:57,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613494773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:29:57,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:29:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-17 15:29:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665772672] [2025-03-17 15:29:57,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:29:57,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 15:29:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:57,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 15:29:57,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-17 15:29:57,634 INFO L87 Difference]: Start difference. First operand 292 states and 333 transitions. Second operand has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 15:29:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:58,584 INFO L93 Difference]: Finished difference Result 331 states and 380 transitions. [2025-03-17 15:29:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 15:29:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 65 [2025-03-17 15:29:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:58,586 INFO L225 Difference]: With dead ends: 331 [2025-03-17 15:29:58,586 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 15:29:58,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2025-03-17 15:29:58,589 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 219 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:58,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 273 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:29:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 15:29:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 305. [2025-03-17 15:29:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 244 states have (on average 1.1598360655737705) internal successors, (283), 247 states have internal predecessors, (283), 32 states have call successors, (32), 26 states have call predecessors, (32), 26 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 15:29:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 347 transitions. [2025-03-17 15:29:58,612 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 347 transitions. Word has length 65 [2025-03-17 15:29:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:58,612 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 347 transitions. [2025-03-17 15:29:58,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 15:29:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 347 transitions. [2025-03-17 15:29:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 15:29:58,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:58,613 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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:29:58,621 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:29:58,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 15:29:58,814 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:58,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash 878798126, now seen corresponding path program 1 times [2025-03-17 15:29:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:58,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289511048] [2025-03-17 15:29:58,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:58,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:29:58,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:29:58,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:58,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 15:29:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289511048] [2025-03-17 15:29:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289511048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:29:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279769946] [2025-03-17 15:29:59,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:29:59,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:59,038 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:29:59,040 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:29:59,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:29:59,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:29:59,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:59,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:59,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:29:59,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:29:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:59,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:29:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 15:29:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279769946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:29:59,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:29:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 26 [2025-03-17 15:29:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760784948] [2025-03-17 15:29:59,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:29:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 15:29:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:59,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 15:29:59,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:29:59,384 INFO L87 Difference]: Start difference. First operand 305 states and 347 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 11 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-17 15:30:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:00,003 INFO L93 Difference]: Finished difference Result 527 states and 610 transitions. [2025-03-17 15:30:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 15:30:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 11 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) Word has length 79 [2025-03-17 15:30:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:00,006 INFO L225 Difference]: With dead ends: 527 [2025-03-17 15:30:00,006 INFO L226 Difference]: Without dead ends: 368 [2025-03-17 15:30:00,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=512, Invalid=1380, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 15:30:00,007 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 111 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:00,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:30:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-17 15:30:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 349. [2025-03-17 15:30:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 280 states have (on average 1.1535714285714285) internal successors, (323), 283 states have internal predecessors, (323), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 15:30:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 395 transitions. [2025-03-17 15:30:00,032 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 395 transitions. Word has length 79 [2025-03-17 15:30:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:00,032 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 395 transitions. [2025-03-17 15:30:00,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 11 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-17 15:30:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 395 transitions. [2025-03-17 15:30:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:30:00,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:00,034 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-17 15:30:00,042 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:30:00,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:00,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:00,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1575096724, now seen corresponding path program 1 times [2025-03-17 15:30:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:00,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011816967] [2025-03-17 15:30:00,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:00,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:00,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:00,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:00,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:00,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011816967] [2025-03-17 15:30:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011816967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849763066] [2025-03-17 15:30:00,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:00,495 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:30:00,496 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:30:00,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:00,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:00,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:00,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:00,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:30:00,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:00,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:01,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849763066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:01,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:01,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-17 15:30:01,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514908284] [2025-03-17 15:30:01,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:01,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 15:30:01,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:01,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 15:30:01,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 15:30:01,013 INFO L87 Difference]: Start difference. First operand 349 states and 395 transitions. Second operand has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:02,652 INFO L93 Difference]: Finished difference Result 765 states and 894 transitions. [2025-03-17 15:30:02,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-17 15:30:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 85 [2025-03-17 15:30:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:02,656 INFO L225 Difference]: With dead ends: 765 [2025-03-17 15:30:02,656 INFO L226 Difference]: Without dead ends: 606 [2025-03-17 15:30:02,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=7350, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 15:30:02,660 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 563 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:02,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 376 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 15:30:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-17 15:30:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 545. [2025-03-17 15:30:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 436 states have (on average 1.176605504587156) internal successors, (513), 439 states have internal predecessors, (513), 56 states have call successors, (56), 50 states have call predecessors, (56), 50 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 15:30:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 625 transitions. [2025-03-17 15:30:02,696 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 625 transitions. Word has length 85 [2025-03-17 15:30:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:02,697 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 625 transitions. [2025-03-17 15:30:02,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 625 transitions. [2025-03-17 15:30:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:30:02,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:02,698 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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:30:02,705 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:30:02,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:02,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:02,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1505985093, now seen corresponding path program 1 times [2025-03-17 15:30:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:02,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167367767] [2025-03-17 15:30:02,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:02,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:02,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:02,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:02,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:03,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167367767] [2025-03-17 15:30:03,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167367767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:03,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446786392] [2025-03-17 15:30:03,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:03,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:03,084 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:30:03,086 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:30:03,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:03,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:03,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:03,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:03,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:30:03,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:03,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446786392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:03,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-17 15:30:03,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290418625] [2025-03-17 15:30:03,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:03,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 15:30:03,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:03,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 15:30:03,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 15:30:03,555 INFO L87 Difference]: Start difference. First operand 545 states and 625 transitions. Second operand has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:05,006 INFO L93 Difference]: Finished difference Result 715 states and 823 transitions. [2025-03-17 15:30:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-17 15:30:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 85 [2025-03-17 15:30:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:05,011 INFO L225 Difference]: With dead ends: 715 [2025-03-17 15:30:05,011 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 15:30:05,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2025-03-17 15:30:05,015 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 316 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:05,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 460 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 15:30:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 15:30:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 607. [2025-03-17 15:30:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 484 states have (on average 1.1838842975206612) internal successors, (573), 487 states have internal predecessors, (573), 63 states have call successors, (63), 57 states have call predecessors, (63), 57 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 15:30:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 699 transitions. [2025-03-17 15:30:05,051 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 699 transitions. Word has length 85 [2025-03-17 15:30:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:05,051 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 699 transitions. [2025-03-17 15:30:05,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 699 transitions. [2025-03-17 15:30:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 15:30:05,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:05,053 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-17 15:30:05,060 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:30:05,253 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,SelfDestructingSolverStorable13 [2025-03-17 15:30:05,254 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:05,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash 35941910, now seen corresponding path program 1 times [2025-03-17 15:30:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497149423] [2025-03-17 15:30:05,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:05,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 15:30:05,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 15:30:05,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:05,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 15:30:05,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:05,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497149423] [2025-03-17 15:30:05,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497149423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:05,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737910865] [2025-03-17 15:30:05,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:05,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:05,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:05,525 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:30:05,527 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:30:05,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 15:30:05,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 15:30:05,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:05,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:05,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 15:30:05,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:05,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 15:30:05,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737910865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:05,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:05,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 28 [2025-03-17 15:30:05,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086960287] [2025-03-17 15:30:05,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:05,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 15:30:05,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:05,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 15:30:05,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:30:05,893 INFO L87 Difference]: Start difference. First operand 607 states and 699 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 11 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-17 15:30:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:06,570 INFO L93 Difference]: Finished difference Result 987 states and 1147 transitions. [2025-03-17 15:30:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 15:30:06,571 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 11 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 99 [2025-03-17 15:30:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:06,574 INFO L225 Difference]: With dead ends: 987 [2025-03-17 15:30:06,574 INFO L226 Difference]: Without dead ends: 698 [2025-03-17 15:30:06,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 180 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=525, Invalid=2025, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 15:30:06,576 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 127 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:06,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 408 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:30:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-17 15:30:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 669. [2025-03-17 15:30:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 536 states have (on average 1.164179104477612) internal successors, (624), 539 states have internal predecessors, (624), 68 states have call successors, (68), 62 states have call predecessors, (68), 62 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 15:30:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 760 transitions. [2025-03-17 15:30:06,612 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 760 transitions. Word has length 99 [2025-03-17 15:30:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:06,612 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 760 transitions. [2025-03-17 15:30:06,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 11 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-17 15:30:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 760 transitions. [2025-03-17 15:30:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 15:30:06,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:06,615 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2025-03-17 15:30:06,623 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:30:06,817 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:30:06,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:06,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1315582483, now seen corresponding path program 1 times [2025-03-17 15:30:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920926607] [2025-03-17 15:30:06,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:06,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:30:06,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:30:06,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 15:30:07,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:07,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920926607] [2025-03-17 15:30:07,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920926607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:07,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019915284] [2025-03-17 15:30:07,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:07,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:07,053 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:30:07,054 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:30:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:30:07,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:30:07,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:07,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:07,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:30:07,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:07,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 15:30:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019915284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:07,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-03-17 15:30:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938449291] [2025-03-17 15:30:07,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:07,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-17 15:30:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:07,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-17 15:30:07,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=2388, Unknown=0, NotChecked=0, Total=2970 [2025-03-17 15:30:07,730 INFO L87 Difference]: Start difference. First operand 669 states and 760 transitions. Second operand has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 55 states have internal predecessors, (161), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-17 15:30:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:09,606 INFO L93 Difference]: Finished difference Result 951 states and 1095 transitions. [2025-03-17 15:30:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-17 15:30:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 55 states have internal predecessors, (161), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) Word has length 105 [2025-03-17 15:30:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:09,610 INFO L225 Difference]: With dead ends: 951 [2025-03-17 15:30:09,611 INFO L226 Difference]: Without dead ends: 949 [2025-03-17 15:30:09,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3619 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2860, Invalid=11902, Unknown=0, NotChecked=0, Total=14762 [2025-03-17 15:30:09,615 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 449 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:09,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 410 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 15:30:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-03-17 15:30:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 698. [2025-03-17 15:30:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 559 states have (on average 1.1753130590339893) internal successors, (657), 563 states have internal predecessors, (657), 71 states have call successors, (71), 65 states have call predecessors, (71), 65 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-17 15:30:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 799 transitions. [2025-03-17 15:30:09,649 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 799 transitions. Word has length 105 [2025-03-17 15:30:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:09,650 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 799 transitions. [2025-03-17 15:30:09,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 55 states have internal predecessors, (161), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-17 15:30:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 799 transitions. [2025-03-17 15:30:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 15:30:09,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:09,654 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 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] [2025-03-17 15:30:09,660 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:30:09,854 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:30:09,854 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:09,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1026281245, now seen corresponding path program 2 times [2025-03-17 15:30:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984118171] [2025-03-17 15:30:09,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:09,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-17 15:30:09,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 15:30:09,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:09,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 15:30:10,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:10,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984118171] [2025-03-17 15:30:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984118171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437036823] [2025-03-17 15:30:10,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:10,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:10,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:10,254 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:30:10,255 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:30:10,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-17 15:30:10,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 15:30:10,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:10,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:10,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 15:30:10,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:10,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 15:30:10,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437036823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:10,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:10,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 52 [2025-03-17 15:30:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399772652] [2025-03-17 15:30:10,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:10,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-17 15:30:10,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:10,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-17 15:30:10,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2209, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 15:30:10,854 INFO L87 Difference]: Start difference. First operand 698 states and 799 transitions. Second operand has 53 states, 52 states have (on average 3.1346153846153846) internal successors, (163), 53 states have internal predecessors, (163), 23 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) [2025-03-17 15:30:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:12,480 INFO L93 Difference]: Finished difference Result 1536 states and 1793 transitions. [2025-03-17 15:30:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-17 15:30:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.1346153846153846) internal successors, (163), 53 states have internal predecessors, (163), 23 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) Word has length 129 [2025-03-17 15:30:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:12,485 INFO L225 Difference]: With dead ends: 1536 [2025-03-17 15:30:12,485 INFO L226 Difference]: Without dead ends: 1178 [2025-03-17 15:30:12,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2506, Invalid=10604, Unknown=0, NotChecked=0, Total=13110 [2025-03-17 15:30:12,489 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 424 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:12,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 440 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 15:30:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-03-17 15:30:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 848. [2025-03-17 15:30:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 679 states have (on average 1.182621502209131) internal successors, (803), 683 states have internal predecessors, (803), 86 states have call successors, (86), 80 states have call predecessors, (86), 80 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 15:30:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 975 transitions. [2025-03-17 15:30:12,537 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 975 transitions. Word has length 129 [2025-03-17 15:30:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:12,538 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 975 transitions. [2025-03-17 15:30:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.1346153846153846) internal successors, (163), 53 states have internal predecessors, (163), 23 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) [2025-03-17 15:30:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 975 transitions. [2025-03-17 15:30:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 15:30:12,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:12,542 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:12,552 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:30:12,742 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,SelfDestructingSolverStorable16 [2025-03-17 15:30:12,742 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1189252426, now seen corresponding path program 2 times [2025-03-17 15:30:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958085203] [2025-03-17 15:30:12,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:12,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 145 statements into 2 equivalence classes. [2025-03-17 15:30:12,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 15:30:12,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:12,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-17 15:30:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958085203] [2025-03-17 15:30:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958085203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:30:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263707946] [2025-03-17 15:30:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:12,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:30:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:12,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:30:12,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:30:12,895 INFO L87 Difference]: Start difference. First operand 848 states and 975 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:30:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:12,991 INFO L93 Difference]: Finished difference Result 865 states and 992 transitions. [2025-03-17 15:30:12,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:30:12,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 145 [2025-03-17 15:30:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:12,996 INFO L225 Difference]: With dead ends: 865 [2025-03-17 15:30:12,996 INFO L226 Difference]: Without dead ends: 864 [2025-03-17 15:30:12,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:30:12,997 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:12,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-17 15:30:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 775. [2025-03-17 15:30:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 620 states have (on average 1.1758064516129032) internal successors, (729), 624 states have internal predecessors, (729), 79 states have call successors, (79), 73 states have call predecessors, (79), 73 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 15:30:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 887 transitions. [2025-03-17 15:30:13,038 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 887 transitions. Word has length 145 [2025-03-17 15:30:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:13,039 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 887 transitions. [2025-03-17 15:30:13,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:30:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 887 transitions. [2025-03-17 15:30:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 15:30:13,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:13,041 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 15:30:13,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:13,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 856668849, now seen corresponding path program 3 times [2025-03-17 15:30:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60988233] [2025-03-17 15:30:13,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:30:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:13,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 149 statements into 10 equivalence classes. [2025-03-17 15:30:13,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 149 statements. [2025-03-17 15:30:13,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 15:30:13,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-17 15:30:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60988233] [2025-03-17 15:30:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60988233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:13,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:30:13,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947505812] [2025-03-17 15:30:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:13,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:30:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:13,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:30:13,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:30:13,112 INFO L87 Difference]: Start difference. First operand 775 states and 887 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (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:30:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:13,221 INFO L93 Difference]: Finished difference Result 792 states and 905 transitions. [2025-03-17 15:30:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:30:13,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (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 149 [2025-03-17 15:30:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:13,226 INFO L225 Difference]: With dead ends: 792 [2025-03-17 15:30:13,227 INFO L226 Difference]: Without dead ends: 791 [2025-03-17 15:30:13,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:30:13,228 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:13,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 176 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-17 15:30:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 491. [2025-03-17 15:30:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 392 states have (on average 1.1428571428571428) internal successors, (448), 397 states have internal predecessors, (448), 51 states have call successors, (51), 45 states have call predecessors, (51), 45 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 15:30:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 550 transitions. [2025-03-17 15:30:13,256 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 550 transitions. Word has length 149 [2025-03-17 15:30:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:13,256 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 550 transitions. [2025-03-17 15:30:13,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (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:30:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 550 transitions. [2025-03-17 15:30:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 15:30:13,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:13,258 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 10, 10, 9, 9, 9, 9, 8, 4, 4, 4, 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] [2025-03-17 15:30:13,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 15:30:13,258 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:13,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 981759759, now seen corresponding path program 1 times [2025-03-17 15:30:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:13,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970932330] [2025-03-17 15:30:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:13,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 15:30:13,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 15:30:13,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:13,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-17 15:30:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:13,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970932330] [2025-03-17 15:30:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970932330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:13,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970260174] [2025-03-17 15:30:13,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:13,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:13,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:13,372 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:30:13,373 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:30:13,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 15:30:13,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 15:30:13,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:13,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:13,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 15:30:13,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 533 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 15:30:13,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 233 proven. 6 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-17 15:30:14,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970260174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:14,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:14,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23, 24] total 29 [2025-03-17 15:30:14,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31679898] [2025-03-17 15:30:14,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:14,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 15:30:14,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:14,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 15:30:14,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:30:14,096 INFO L87 Difference]: Start difference. First operand 491 states and 550 transitions. Second operand has 29 states, 29 states have (on average 4.620689655172414) internal successors, (134), 29 states have internal predecessors, (134), 15 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) [2025-03-17 15:30:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:15,627 INFO L93 Difference]: Finished difference Result 813 states and 922 transitions. [2025-03-17 15:30:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 15:30:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.620689655172414) internal successors, (134), 29 states have internal predecessors, (134), 15 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) Word has length 155 [2025-03-17 15:30:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:15,629 INFO L225 Difference]: With dead ends: 813 [2025-03-17 15:30:15,629 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 15:30:15,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 267 SyntacticMatches, 21 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1130, Invalid=4876, Unknown=0, NotChecked=0, Total=6006 [2025-03-17 15:30:15,633 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 134 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:15,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 830 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 15:30:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 15:30:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 267. [2025-03-17 15:30:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.1367924528301887) internal successors, (241), 213 states have internal predecessors, (241), 28 states have call successors, (28), 25 states have call predecessors, (28), 25 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 15:30:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2025-03-17 15:30:15,650 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 155 [2025-03-17 15:30:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:15,650 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2025-03-17 15:30:15,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.620689655172414) internal successors, (134), 29 states have internal predecessors, (134), 15 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) [2025-03-17 15:30:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2025-03-17 15:30:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 15:30:15,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:15,652 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 10, 10, 10, 9, 4, 4, 4, 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] [2025-03-17 15:30:15,659 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:30:15,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:15,853 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash -243185572, now seen corresponding path program 1 times [2025-03-17 15:30:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:15,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454301734] [2025-03-17 15:30:15,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 15:30:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 15:30:15,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:15,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-17 15:30:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454301734] [2025-03-17 15:30:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454301734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:15,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:15,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:30:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113143224] [2025-03-17 15:30:15,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:15,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:15,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:15,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:15,923 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:30:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:15,965 INFO L93 Difference]: Finished difference Result 423 states and 479 transitions. [2025-03-17 15:30:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 159 [2025-03-17 15:30:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:15,967 INFO L225 Difference]: With dead ends: 423 [2025-03-17 15:30:15,967 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 15:30:15,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:30:15,968 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:15,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 142 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 15:30:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-03-17 15:30:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.0819672131147542) internal successors, (198), 184 states have internal predecessors, (198), 24 states have call successors, (24), 21 states have call predecessors, (24), 21 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 15:30:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 246 transitions. [2025-03-17 15:30:15,994 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 246 transitions. Word has length 159 [2025-03-17 15:30:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:15,995 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 246 transitions. [2025-03-17 15:30:15,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:30:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 246 transitions. [2025-03-17 15:30:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 15:30:15,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:15,999 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 4, 4, 4, 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:30:15,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 15:30:15,999 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:15,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash -295968768, now seen corresponding path program 2 times [2025-03-17 15:30:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:16,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699100300] [2025-03-17 15:30:16,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:16,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 179 statements into 2 equivalence classes. [2025-03-17 15:30:16,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 15:30:16,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:16,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 163 proven. 7 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-17 15:30:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699100300] [2025-03-17 15:30:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699100300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998509420] [2025-03-17 15:30:16,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:16,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:16,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:16,199 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:30:16,201 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:30:16,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 179 statements into 2 equivalence classes. [2025-03-17 15:30:16,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 15:30:16,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:16,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:16,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 15:30:16,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 913 proven. 9 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 15:30:16,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 533 proven. 9 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-17 15:30:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998509420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:16,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 24] total 32 [2025-03-17 15:30:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65664502] [2025-03-17 15:30:16,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 15:30:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 15:30:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:30:16,968 INFO L87 Difference]: Start difference. First operand 230 states and 246 transitions. Second operand has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 15 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 15 states have call predecessors, (38), 15 states have call successors, (38) [2025-03-17 15:30:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:18,092 INFO L93 Difference]: Finished difference Result 369 states and 401 transitions. [2025-03-17 15:30:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-17 15:30:18,093 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 15 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 15 states have call predecessors, (38), 15 states have call successors, (38) Word has length 179 [2025-03-17 15:30:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:18,094 INFO L225 Difference]: With dead ends: 369 [2025-03-17 15:30:18,095 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 15:30:18,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 314 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=963, Invalid=3593, Unknown=0, NotChecked=0, Total=4556 [2025-03-17 15:30:18,096 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 69 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:18,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 732 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 15:30:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 15:30:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2025-03-17 15:30:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 191 states have (on average 1.068062827225131) internal successors, (204), 191 states have internal predecessors, (204), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 15:30:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2025-03-17 15:30:18,108 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 179 [2025-03-17 15:30:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:18,108 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2025-03-17 15:30:18,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 15 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 15 states have call predecessors, (38), 15 states have call successors, (38) [2025-03-17 15:30:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2025-03-17 15:30:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 15:30:18,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:18,110 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:18,117 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:30:18,314 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,SelfDestructingSolverStorable21 [2025-03-17 15:30:18,314 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:18,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash -288706770, now seen corresponding path program 1 times [2025-03-17 15:30:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332725268] [2025-03-17 15:30:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:18,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 15:30:18,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 15:30:18,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:18,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 713 proven. 7 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2025-03-17 15:30:18,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:18,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332725268] [2025-03-17 15:30:18,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332725268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:18,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954765277] [2025-03-17 15:30:18,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:18,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:18,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:18,788 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:30:18,793 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:30:18,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 15:30:18,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 15:30:18,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:18,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:18,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:30:18,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 889 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2025-03-17 15:30:18,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954765277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:18,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 24 [2025-03-17 15:30:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621214383] [2025-03-17 15:30:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:18,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:30:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:18,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:30:18,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:30:18,926 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (8), 2 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:30:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:18,973 INFO L93 Difference]: Finished difference Result 247 states and 263 transitions. [2025-03-17 15:30:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:30:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (8), 2 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 231 [2025-03-17 15:30:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:18,974 INFO L225 Difference]: With dead ends: 247 [2025-03-17 15:30:18,974 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:30:18,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:30:18,975 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:18,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 128 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:30:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:30:18,976 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:30:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:30:18,976 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2025-03-17 15:30:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:18,977 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:30:18,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (8), 2 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:30:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:30:18,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:30:18,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 15:30:18,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 15:30:18,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 15:30:18,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 15:30:18,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 15:30:18,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 15:30:18,987 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:30:19,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:19,184 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:19,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:30:31,365 WARN L286 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 189 DAG size of output: 41 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 15:30:32,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:30:32,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:30:32 BoogieIcfgContainer [2025-03-17 15:30:32,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:30:32,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:30:32,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:30:32,313 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:30:32,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:29:50" (3/4) ... [2025-03-17 15:30:32,315 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:30:32,319 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 15:30:32,319 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:30:32,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 15:30:32,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 15:30:32,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:30:32,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:30:32,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:30:32,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:30:32,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:30:32,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:30:32,385 INFO L158 Benchmark]: Toolchain (without parser) took 42378.22ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 104.9MB in the beginning and 422.9MB in the end (delta: -318.0MB). Peak memory consumption was 228.6MB. Max. memory is 16.1GB. [2025-03-17 15:30:32,386 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:30:32,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.54ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 94.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:30:32,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.10ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:30:32,388 INFO L158 Benchmark]: Boogie Preprocessor took 33.47ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:30:32,388 INFO L158 Benchmark]: IcfgBuilder took 333.46ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 77.2MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:30:32,388 INFO L158 Benchmark]: TraceAbstraction took 41698.90ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 77.2MB in the beginning and 431.2MB in the end (delta: -354.0MB). Peak memory consumption was 383.9MB. Max. memory is 16.1GB. [2025-03-17 15:30:32,388 INFO L158 Benchmark]: Witness Printer took 71.23ms. Allocated memory is still 687.9MB. Free memory was 431.2MB in the beginning and 422.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:30:32,389 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.75ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.54ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 94.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.10ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.47ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 333.46ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 77.2MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41698.90ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 77.2MB in the beginning and 431.2MB in the end (delta: -354.0MB). Peak memory consumption was 383.9MB. Max. memory is 16.1GB. * Witness Printer took 71.23ms. Allocated memory is still 687.9MB. Free memory was 431.2MB in the beginning and 422.9MB in the end (delta: 8.3MB). 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: 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: 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, 43 locations, 69 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 23, TraceHistogramMax: 19, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3179 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3173 mSDsluCounter, 6799 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5847 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5885 IncrementalHoareTripleChecker+Invalid, 6242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 952 mSDtfsCounter, 5885 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3274 GetRequests, 2285 SyntacticMatches, 54 SemanticMatches, 935 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17654 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848occurred in iteration=17, InterpolantAutomatonStates: 730, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 1489 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 3557 NumberOfCodeBlocks, 3452 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 4647 ConstructedInterpolants, 0 QuantifiedInterpolants, 9131 SizeOfPredicates, 161 NumberOfNonLiveVariables, 3332 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 49 InterpolantComputations, 11 PerfectInterpolantSequences, 12002/13860 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 6 specifications checked. All of them hold - InvariantResult [Line: 44]: Location Invariant Derived location invariant: ((((((counter == 3) || (counter == 5)) || (counter == 4)) || ((y != x) && (counter == 1))) || ((counter <= 10) && (6 <= counter))) || (counter == 2)) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((counter <= 10) && (3 <= counter)) || (counter == 11)) || (((2 <= counter) && (counter <= 10)) && (x <= y))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((12 <= counter) && (counter <= 2147483646)) || (counter == 0)) || (((counter <= 2147483646) && (x <= y)) && (3 <= counter))) || ((4 <= counter) && ((counter < 11) || (counter == 11)))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:30:32,410 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