./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/rec_counter1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/rec_counter1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash de5b7f1cccf5c7fe435559014125bbfd73538586d5303d45f8d606cb31a4b74b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:33:42,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:33:42,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:33:42,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:33:42,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:33:42,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:33:42,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:33:42,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:33:42,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:33:42,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:33:42,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:33:42,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:33:42,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:33:42,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:33:42,371 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:33:42,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:33:42,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:33:42,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:33:42,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:33:42,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:33:42,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:33:42,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:33:42,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:33:42,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:33:42,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:33:42,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:33:42,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:33:42,374 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de5b7f1cccf5c7fe435559014125bbfd73538586d5303d45f8d606cb31a4b74b [2025-03-04 10:33:42,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:33:42,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:33:42,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:33:42,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:33:42,648 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:33:42,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/rec_counter1.c [2025-03-04 10:33:43,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e6efb0d/2722753fb16c41638530227c16a328bb/FLAGfae9218f0 [2025-03-04 10:33:44,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:33:44,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/rec_counter1.c [2025-03-04 10:33:44,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e6efb0d/2722753fb16c41638530227c16a328bb/FLAGfae9218f0 [2025-03-04 10:33:44,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e6efb0d/2722753fb16c41638530227c16a328bb [2025-03-04 10:33:44,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:33:44,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:33:44,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:33:44,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:33:44,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:33:44,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3e505b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44, skipping insertion in model container [2025-03-04 10:33:44,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:33:44,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:33:44,184 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:33:44,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:33:44,202 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:33:44,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44 WrapperNode [2025-03-04 10:33:44,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:33:44,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:33:44,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:33:44,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:33:44,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,220 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-03-04 10:33:44,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:33:44,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:33:44,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:33:44,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:33:44,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,230 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:33:44,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:33:44,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:33:44,233 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:33:44,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:33:44,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (1/1) ... [2025-03-04 10:33:44,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:33:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:44,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:33:44,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:33:44,277 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-03-04 10:33:44,277 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-03-04 10:33:44,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:33:44,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:33:44,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:33:44,316 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:33:44,421 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: havoc ~res~0, ~rescopy~0; [2025-03-04 10:33:44,457 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-04 10:33:44,457 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:33:44,465 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:33:44,465 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:33:44,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:33:44 BoogieIcfgContainer [2025-03-04 10:33:44,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:33:44,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:33:44,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:33:44,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:33:44,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:33:44" (1/3) ... [2025-03-04 10:33:44,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610077a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:33:44, skipping insertion in model container [2025-03-04 10:33:44,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:44" (2/3) ... [2025-03-04 10:33:44,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610077a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:33:44, skipping insertion in model container [2025-03-04 10:33:44,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:33:44" (3/3) ... [2025-03-04 10:33:44,473 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_counter1.c [2025-03-04 10:33:44,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:33:44,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_counter1.c that has 2 procedures, 27 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-04 10:33:44,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:33:44,540 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;@5ef75d8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:33:44,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:33:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:33:44,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:44,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:44,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1621080396, now seen corresponding path program 1 times [2025-03-04 10:33:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:44,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270114902] [2025-03-04 10:33:44,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:44,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:33:44,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:33:44,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:44,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270114902] [2025-03-04 10:33:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270114902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878195028] [2025-03-04 10:33:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:44,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:44,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:44,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:44,732 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:44,816 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2025-03-04 10:33:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:33:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:44,821 INFO L225 Difference]: With dead ends: 53 [2025-03-04 10:33:44,821 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 10:33:44,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:44,826 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:44,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 10:33:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-03-04 10:33:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-03-04 10:33:44,860 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2025-03-04 10:33:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:44,861 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-04 10:33:44,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-03-04 10:33:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:33:44,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:44,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:44,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:33:44,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:44,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1286115292, now seen corresponding path program 1 times [2025-03-04 10:33:44,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:44,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585730263] [2025-03-04 10:33:44,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:44,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:33:44,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:33:44,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:44,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585730263] [2025-03-04 10:33:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585730263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439257548] [2025-03-04 10:33:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:44,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:44,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:44,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:44,925 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:44,959 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-03-04 10:33:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:33:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:44,961 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:33:44,961 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:33:44,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:44,962 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:44,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:33:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-04 10:33:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-04 10:33:44,973 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 8 [2025-03-04 10:33:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:44,973 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-04 10:33:44,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-04 10:33:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:33:44,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:44,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:44,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:33:44,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:44,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:44,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1545245527, now seen corresponding path program 1 times [2025-03-04 10:33:44,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:44,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622086330] [2025-03-04 10:33:44,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:44,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:33:44,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:33:44,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622086330] [2025-03-04 10:33:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622086330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030359171] [2025-03-04 10:33:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:45,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:45,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:45,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:33:45,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:33:45,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:33:45,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:33:45,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:45,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030359171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:45,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:45,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:33:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584879709] [2025-03-04 10:33:45,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:33:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:33:45,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:33:45,249 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:45,334 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-04 10:33:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:33:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:33:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:45,335 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:33:45,335 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:33:45,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:33:45,336 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:45,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:33:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-03-04 10:33:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-04 10:33:45,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 12 [2025-03-04 10:33:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:45,341 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-04 10:33:45,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-04 10:33:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:33:45,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,342 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:45,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:33:45,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:45,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:45,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1125883656, now seen corresponding path program 1 times [2025-03-04 10:33:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:45,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972593135] [2025-03-04 10:33:45,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:45,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972593135] [2025-03-04 10:33:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972593135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:45,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:33:45,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217765453] [2025-03-04 10:33:45,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:33:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:33:45,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:45,612 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:45,628 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-04 10:33:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:33:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 10:33:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:45,630 INFO L225 Difference]: With dead ends: 32 [2025-03-04 10:33:45,631 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 10:33:45,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:45,631 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:45,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 10:33:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 10:33:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-04 10:33:45,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2025-03-04 10:33:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:45,636 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-04 10:33:45,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-04 10:33:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:33:45,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:45,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:33:45,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:45,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:45,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1125883629, now seen corresponding path program 1 times [2025-03-04 10:33:45,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:45,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672897320] [2025-03-04 10:33:45,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:45,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:45,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:45,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672897320] [2025-03-04 10:33:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672897320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:33:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394789155] [2025-03-04 10:33:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:33:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:33:45,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:45,683 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:45,693 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-04 10:33:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:33:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 10:33:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:45,695 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:33:45,695 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:33:45,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:45,695 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:45,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:33:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 10:33:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-04 10:33:45,701 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2025-03-04 10:33:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:45,701 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-04 10:33:45,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-04 10:33:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:33:45,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,702 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:45,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:33:45,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -542654992, now seen corresponding path program 1 times [2025-03-04 10:33:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320223327] [2025-03-04 10:33:45,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:45,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:33:45,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:33:45,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:45,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320223327] [2025-03-04 10:33:45,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320223327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:45,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:45,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:33:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153530427] [2025-03-04 10:33:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:45,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:45,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:45,774 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:45,798 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-03-04 10:33:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 10:33:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:45,800 INFO L225 Difference]: With dead ends: 52 [2025-03-04 10:33:45,801 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:33:45,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:45,801 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:45,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:33:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:33:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:33:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-04 10:33:45,811 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 17 [2025-03-04 10:33:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:45,811 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-04 10:33:45,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-04 10:33:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:33:45,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,812 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:45,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:33:45,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:45,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash -542654159, now seen corresponding path program 1 times [2025-03-04 10:33:45,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:45,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803305583] [2025-03-04 10:33:45,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:45,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:33:45,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:33:45,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803305583] [2025-03-04 10:33:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803305583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:45,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:45,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:33:45,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844696940] [2025-03-04 10:33:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:33:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:33:45,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:45,860 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:45,885 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-04 10:33:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:33:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 10:33:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:45,885 INFO L225 Difference]: With dead ends: 43 [2025-03-04 10:33:45,885 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:33:45,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:45,886 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:45,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:33:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:33:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-04 10:33:45,891 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 17 [2025-03-04 10:33:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:45,892 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-04 10:33:45,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-04 10:33:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:33:45,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,893 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:45,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:33:45,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:45,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash -840113853, now seen corresponding path program 1 times [2025-03-04 10:33:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:45,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168125318] [2025-03-04 10:33:45,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:45,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:33:45,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:45,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:33:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168125318] [2025-03-04 10:33:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168125318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960347800] [2025-03-04 10:33:45,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:45,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:45,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:33:46,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:33:46,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:46,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:46,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:33:46,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:46,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960347800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:46,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-04 10:33:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020585414] [2025-03-04 10:33:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:46,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:33:46,073 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:33:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,090 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-04 10:33:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:33:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:33:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,092 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:33:46,092 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:33:46,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:33:46,092 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:33:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 10:33:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-04 10:33:46,097 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2025-03-04 10:33:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,097 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-04 10:33:46,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:33:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-04 10:33:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:33:46,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,098 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:46,298 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-04 10:33:46,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1057380024, now seen corresponding path program 1 times [2025-03-04 10:33:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321369181] [2025-03-04 10:33:46,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:33:46,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:33:46,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:33:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321369181] [2025-03-04 10:33:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321369181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194260053] [2025-03-04 10:33:46,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:46,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:46,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:33:46,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:33:46,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:33:46,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:46,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:33:46,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:33:46,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194260053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:46,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-03-04 10:33:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419746357] [2025-03-04 10:33:46,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:33:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:33:46,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:46,626 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:33:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,790 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2025-03-04 10:33:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:33:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 31 [2025-03-04 10:33:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,791 INFO L225 Difference]: With dead ends: 110 [2025-03-04 10:33:46,791 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 10:33:46,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:33:46,792 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 127 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 10:33:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-04 10:33:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-04 10:33:46,805 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 31 [2025-03-04 10:33:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,806 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-04 10:33:46,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:33:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-03-04 10:33:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:33:46,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,809 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:47,009 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-04 10:33:47,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1963771509, now seen corresponding path program 2 times [2025-03-04 10:33:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683823601] [2025-03-04 10:33:47,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:47,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 10:33:47,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:33:47,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:47,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 121 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 10:33:47,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683823601] [2025-03-04 10:33:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683823601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822678696] [2025-03-04 10:33:47,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:47,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:47,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:47,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:33:47,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 10:33:47,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:33:47,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:47,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:47,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:33:47,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 10:33:47,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 10:33:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822678696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:48,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 22 [2025-03-04 10:33:48,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467583115] [2025-03-04 10:33:48,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:33:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:33:48,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:48,156 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:33:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:48,406 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2025-03-04 10:33:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:33:48,406 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 82 [2025-03-04 10:33:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:48,407 INFO L225 Difference]: With dead ends: 143 [2025-03-04 10:33:48,407 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 10:33:48,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:33:48,409 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:48,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 10:33:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 10:33:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-03-04 10:33:48,416 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 82 [2025-03-04 10:33:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:48,416 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-03-04 10:33:48,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:33:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-03-04 10:33:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 10:33:48,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,418 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:33:48,618 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-04 10:33:48,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash -221708357, now seen corresponding path program 3 times [2025-03-04 10:33:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094424100] [2025-03-04 10:33:48,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 6 equivalence classes. [2025-03-04 10:33:48,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 88 statements. [2025-03-04 10:33:48,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:33:48,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:33:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094424100] [2025-03-04 10:33:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094424100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088591762] [2025-03-04 10:33:48,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:48,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:48,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:33:48,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 6 equivalence classes. [2025-03-04 10:33:48,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 88 statements. [2025-03-04 10:33:48,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:33:48,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:33:48,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:33:48,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 10:33:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088591762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:48,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 10:33:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050126357] [2025-03-04 10:33:48,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:33:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:49,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:33:49,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:49,002 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:49,059 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2025-03-04 10:33:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:33:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-03-04 10:33:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:49,061 INFO L225 Difference]: With dead ends: 175 [2025-03-04 10:33:49,062 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 10:33:49,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:49,063 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:49,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 10:33:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2025-03-04 10:33:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-03-04 10:33:49,083 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 88 [2025-03-04 10:33:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:49,083 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-03-04 10:33:49,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-03-04 10:33:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 10:33:49,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:49,085 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:49,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:33:49,291 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-04 10:33:49,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1912777381, now seen corresponding path program 4 times [2025-03-04 10:33:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015071882] [2025-03-04 10:33:49,292 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:49,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-03-04 10:33:49,328 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:33:49,328 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:49,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 197 proven. 143 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-04 10:33:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015071882] [2025-03-04 10:33:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015071882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968158749] [2025-03-04 10:33:49,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:49,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:49,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:49,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:49,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:33:49,997 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-03-04 10:33:50,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:33:50,019 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:50,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:33:50,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-04 10:33:50,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-04 10:33:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968158749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:51,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:51,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 16] total 52 [2025-03-04 10:33:51,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953780835] [2025-03-04 10:33:51,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:51,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 10:33:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:51,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 10:33:51,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2353, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:33:51,085 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 52 states, 52 states have (on average 2.480769230769231) internal successors, (129), 42 states have internal predecessors, (129), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 10:33:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:51,772 INFO L93 Difference]: Finished difference Result 498 states and 562 transitions. [2025-03-04 10:33:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-04 10:33:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.480769230769231) internal successors, (129), 42 states have internal predecessors, (129), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 10:33:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:51,775 INFO L225 Difference]: With dead ends: 498 [2025-03-04 10:33:51,777 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 10:33:51,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1171, Invalid=8729, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 10:33:51,784 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:51,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 245 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 10:33:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 202. [2025-03-04 10:33:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 187 states have (on average 1.0748663101604279) internal successors, (201), 187 states have internal predecessors, (201), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:33:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2025-03-04 10:33:51,800 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 110 [2025-03-04 10:33:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:51,800 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2025-03-04 10:33:51,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.480769230769231) internal successors, (129), 42 states have internal predecessors, (129), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 10:33:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2025-03-04 10:33:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-04 10:33:51,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:51,803 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:51,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:33:52,007 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-04 10:33:52,007 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:52,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1737171547, now seen corresponding path program 5 times [2025-03-04 10:33:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264514282] [2025-03-04 10:33:52,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:52,019 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 220 statements into 14 equivalence classes. [2025-03-04 10:33:52,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 94 of 220 statements. [2025-03-04 10:33:52,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 10:33:52,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1041 proven. 53 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2025-03-04 10:33:52,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264514282] [2025-03-04 10:33:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264514282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:52,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219223281] [2025-03-04 10:33:52,233 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:52,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:52,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:52,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:52,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:33:52,318 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 220 statements into 14 equivalence classes. [2025-03-04 10:33:52,344 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 94 of 220 statements. [2025-03-04 10:33:52,344 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 10:33:52,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:33:52,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1025 proven. 88 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-04 10:33:52,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1043 proven. 70 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-04 10:33:53,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219223281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:53,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 23 [2025-03-04 10:33:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100253117] [2025-03-04 10:33:53,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:53,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:33:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:53,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:33:53,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:33:53,283 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:33:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:53,486 INFO L93 Difference]: Finished difference Result 347 states and 378 transitions. [2025-03-04 10:33:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:33:53,486 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 220 [2025-03-04 10:33:53,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:53,487 INFO L225 Difference]: With dead ends: 347 [2025-03-04 10:33:53,487 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 10:33:53,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 421 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:33:53,489 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:53,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 10:33:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-04 10:33:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 202 states have (on average 1.0594059405940595) internal successors, (214), 202 states have internal predecessors, (214), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:33:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 229 transitions. [2025-03-04 10:33:53,509 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 229 transitions. Word has length 220 [2025-03-04 10:33:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:53,509 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 229 transitions. [2025-03-04 10:33:53,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:33:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 229 transitions. [2025-03-04 10:33:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 10:33:53,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:53,512 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:53,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:53,716 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-04 10:33:53,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1405698059, now seen corresponding path program 6 times [2025-03-04 10:33:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913441964] [2025-03-04 10:33:53,716 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:53,724 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 248 statements into 14 equivalence classes. [2025-03-04 10:33:53,752 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 182 of 248 statements. [2025-03-04 10:33:53,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-04 10:33:53,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1938 trivial. 0 not checked. [2025-03-04 10:33:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913441964] [2025-03-04 10:33:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913441964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266070772] [2025-03-04 10:33:53,961 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:53,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:53,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:53,963 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:53,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:33:54,033 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 248 statements into 14 equivalence classes. [2025-03-04 10:33:54,073 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 182 of 248 statements. [2025-03-04 10:33:54,074 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-04 10:33:54,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:54,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:33:54,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1938 trivial. 0 not checked. [2025-03-04 10:33:54,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1938 trivial. 0 not checked. [2025-03-04 10:33:54,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266070772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:54,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:54,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2025-03-04 10:33:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042963472] [2025-03-04 10:33:54,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:54,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:33:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:54,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:33:54,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:33:54,612 INFO L87 Difference]: Start difference. First operand 217 states and 229 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:33:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:54,965 INFO L93 Difference]: Finished difference Result 614 states and 695 transitions. [2025-03-04 10:33:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 10:33:54,966 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 248 [2025-03-04 10:33:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:54,968 INFO L225 Difference]: With dead ends: 614 [2025-03-04 10:33:54,968 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 10:33:54,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=676, Invalid=2404, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 10:33:54,970 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:54,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 10:33:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 247. [2025-03-04 10:33:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 232 states have internal predecessors, (252), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:33:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 267 transitions. [2025-03-04 10:33:54,986 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 267 transitions. Word has length 248 [2025-03-04 10:33:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:54,986 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 267 transitions. [2025-03-04 10:33:54,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:33:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 267 transitions. [2025-03-04 10:33:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-04 10:33:54,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:54,988 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:54,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:33:55,189 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-04 10:33:55,189 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:55,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1362647557, now seen corresponding path program 7 times [2025-03-04 10:33:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939617573] [2025-03-04 10:33:55,190 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:55,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 10:33:55,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 10:33:55,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:55,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 2388 proven. 90 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2025-03-04 10:33:55,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939617573] [2025-03-04 10:33:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939617573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765128715] [2025-03-04 10:33:55,676 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:55,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:55,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:55,678 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:55,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:33:55,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 10:33:55,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 10:33:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:33:55,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 1958 proven. 177 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-04 10:33:56,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 1958 proven. 177 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-04 10:33:58,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765128715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:58,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 28] total 37 [2025-03-04 10:33:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184246272] [2025-03-04 10:33:58,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:58,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 10:33:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 10:33:58,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:33:58,810 INFO L87 Difference]: Start difference. First operand 247 states and 267 transitions. Second operand has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:33:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:59,413 INFO L93 Difference]: Finished difference Result 413 states and 454 transitions. [2025-03-04 10:33:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 10:33:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 262 [2025-03-04 10:33:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:59,415 INFO L225 Difference]: With dead ends: 413 [2025-03-04 10:33:59,415 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 10:33:59,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 482 SyntacticMatches, 26 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=512, Invalid=3910, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 10:33:59,416 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:59,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 10:33:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-04 10:33:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 241 states have (on average 1.070539419087137) internal successors, (258), 241 states have internal predecessors, (258), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:33:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2025-03-04 10:33:59,438 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 262 [2025-03-04 10:33:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:59,438 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2025-03-04 10:33:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:33:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2025-03-04 10:33:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-04 10:33:59,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:59,442 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:59,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:59,642 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-04 10:33:59,642 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:59,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:59,643 INFO L85 PathProgramCache]: Analyzing trace with hash -915231215, now seen corresponding path program 8 times [2025-03-04 10:33:59,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:59,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163070043] [2025-03-04 10:33:59,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:59,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 271 statements into 2 equivalence classes. [2025-03-04 10:33:59,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 271 of 271 statements. [2025-03-04 10:33:59,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:59,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2742 proven. 138 refuted. 0 times theorem prover too weak. 1659 trivial. 0 not checked. [2025-03-04 10:34:00,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163070043] [2025-03-04 10:34:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163070043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423907535] [2025-03-04 10:34:00,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:00,185 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:00,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:34:00,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 271 statements into 2 equivalence classes. [2025-03-04 10:34:00,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 271 of 271 statements. [2025-03-04 10:34:00,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:00,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:00,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:34:00,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2566 proven. 311 refuted. 0 times theorem prover too weak. 1662 trivial. 0 not checked. [2025-03-04 10:34:00,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2566 proven. 311 refuted. 0 times theorem prover too weak. 1662 trivial. 0 not checked. [2025-03-04 10:34:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423907535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:03,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 44 [2025-03-04 10:34:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967005991] [2025-03-04 10:34:03,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:03,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:34:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:03,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:34:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:34:03,922 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:04,705 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2025-03-04 10:34:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-04 10:34:04,705 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 271 [2025-03-04 10:34:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:04,707 INFO L225 Difference]: With dead ends: 407 [2025-03-04 10:34:04,707 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 10:34:04,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 492 SyntacticMatches, 31 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=823, Invalid=6659, Unknown=0, NotChecked=0, Total=7482 [2025-03-04 10:34:04,710 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:04,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:34:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 10:34:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-04 10:34:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 250 states have (on average 1.06) internal successors, (265), 250 states have internal predecessors, (265), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:34:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 280 transitions. [2025-03-04 10:34:04,727 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 280 transitions. Word has length 271 [2025-03-04 10:34:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:04,727 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 280 transitions. [2025-03-04 10:34:04,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 280 transitions. [2025-03-04 10:34:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-04 10:34:04,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:04,730 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:04,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:34:04,930 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-04 10:34:04,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:04,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1207481579, now seen corresponding path program 9 times [2025-03-04 10:34:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:04,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732444086] [2025-03-04 10:34:04,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:04,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 280 statements into 14 equivalence classes. [2025-03-04 10:34:04,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 196 of 280 statements. [2025-03-04 10:34:04,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 10:34:04,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-03-04 10:34:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732444086] [2025-03-04 10:34:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732444086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826627440] [2025-03-04 10:34:05,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:05,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:05,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:05,259 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:05,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:34:05,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 280 statements into 14 equivalence classes. [2025-03-04 10:34:05,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 196 of 280 statements. [2025-03-04 10:34:05,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 10:34:05,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:05,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:34:05,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-03-04 10:34:05,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-03-04 10:34:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826627440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:06,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:06,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 43 [2025-03-04 10:34:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318282283] [2025-03-04 10:34:06,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:06,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:34:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:06,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:34:06,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:34:06,390 INFO L87 Difference]: Start difference. First operand 265 states and 280 transitions. Second operand has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:34:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:07,624 INFO L93 Difference]: Finished difference Result 947 states and 1070 transitions. [2025-03-04 10:34:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-04 10:34:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 280 [2025-03-04 10:34:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:07,628 INFO L225 Difference]: With dead ends: 947 [2025-03-04 10:34:07,628 INFO L226 Difference]: Without dead ends: 827 [2025-03-04 10:34:07,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4731 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2981, Invalid=11299, Unknown=0, NotChecked=0, Total=14280 [2025-03-04 10:34:07,632 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:07,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-04 10:34:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 328. [2025-03-04 10:34:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 313 states have (on average 1.1022364217252396) internal successors, (345), 313 states have internal predecessors, (345), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:34:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 360 transitions. [2025-03-04 10:34:07,663 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 360 transitions. Word has length 280 [2025-03-04 10:34:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:07,664 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 360 transitions. [2025-03-04 10:34:07,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:34:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 360 transitions. [2025-03-04 10:34:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-04 10:34:07,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:07,665 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:07,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:07,870 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-04 10:34:07,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:07,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1553539473, now seen corresponding path program 10 times [2025-03-04 10:34:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:07,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568033034] [2025-03-04 10:34:07,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:07,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:07,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 331 statements into 2 equivalence classes. [2025-03-04 10:34:07,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 331 of 331 statements. [2025-03-04 10:34:07,944 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:07,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8209 backedges. 2360 proven. 247 refuted. 0 times theorem prover too weak. 5602 trivial. 0 not checked. [2025-03-04 10:34:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568033034] [2025-03-04 10:34:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568033034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641633426] [2025-03-04 10:34:08,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:08,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:08,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:08,648 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:08,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:34:08,773 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 331 statements into 2 equivalence classes. [2025-03-04 10:34:08,828 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 331 of 331 statements. [2025-03-04 10:34:08,828 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:08,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:08,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 10:34:08,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8209 backedges. 2360 proven. 247 refuted. 0 times theorem prover too weak. 5602 trivial. 0 not checked. [2025-03-04 10:34:08,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8209 backedges. 2360 proven. 247 refuted. 0 times theorem prover too weak. 5602 trivial. 0 not checked. [2025-03-04 10:34:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641633426] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:09,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 59 [2025-03-04 10:34:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981230623] [2025-03-04 10:34:09,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:09,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-04 10:34:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:09,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-04 10:34:09,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 10:34:09,647 INFO L87 Difference]: Start difference. First operand 328 states and 360 transitions. Second operand has 60 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 60 states have internal predecessors, (106), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:34:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:09,857 INFO L93 Difference]: Finished difference Result 711 states and 862 transitions. [2025-03-04 10:34:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 10:34:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 60 states have internal predecessors, (106), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 331 [2025-03-04 10:34:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:09,861 INFO L225 Difference]: With dead ends: 711 [2025-03-04 10:34:09,861 INFO L226 Difference]: Without dead ends: 706 [2025-03-04 10:34:09,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 10:34:09,862 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:09,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-04 10:34:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 412. [2025-03-04 10:34:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 397 states have (on average 1.1158690176322419) internal successors, (443), 397 states have internal predecessors, (443), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:34:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 458 transitions. [2025-03-04 10:34:09,922 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 458 transitions. Word has length 331 [2025-03-04 10:34:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:09,922 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 458 transitions. [2025-03-04 10:34:09,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 60 states have internal predecessors, (106), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:34:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 458 transitions. [2025-03-04 10:34:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-04 10:34:09,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:09,926 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:09,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:34:10,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:34:10,127 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:10,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash -913697839, now seen corresponding path program 11 times [2025-03-04 10:34:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:10,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521784137] [2025-03-04 10:34:10,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:10,144 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 373 statements into 28 equivalence classes. [2025-03-04 10:34:10,191 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 287 of 373 statements. [2025-03-04 10:34:10,191 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-03-04 10:34:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11492 backedges. 4871 proven. 444 refuted. 0 times theorem prover too weak. 6177 trivial. 0 not checked. [2025-03-04 10:34:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521784137] [2025-03-04 10:34:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521784137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087188822] [2025-03-04 10:34:10,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:10,747 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:10,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:34:10,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 373 statements into 28 equivalence classes. [2025-03-04 10:34:10,958 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 287 of 373 statements. [2025-03-04 10:34:10,959 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-03-04 10:34:10,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:10,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:34:10,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11492 backedges. 4644 proven. 696 refuted. 0 times theorem prover too weak. 6152 trivial. 0 not checked. [2025-03-04 10:34:11,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11492 backedges. 4644 proven. 696 refuted. 0 times theorem prover too weak. 6152 trivial. 0 not checked. [2025-03-04 10:34:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087188822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:13,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 33] total 40 [2025-03-04 10:34:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131304576] [2025-03-04 10:34:13,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:13,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:34:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:13,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:34:13,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:34:13,545 INFO L87 Difference]: Start difference. First operand 412 states and 458 transitions. Second operand has 40 states, 40 states have (on average 2.425) internal successors, (97), 35 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 10:34:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:14,056 INFO L93 Difference]: Finished difference Result 758 states and 850 transitions. [2025-03-04 10:34:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-04 10:34:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.425) internal successors, (97), 35 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 373 [2025-03-04 10:34:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:14,059 INFO L225 Difference]: With dead ends: 758 [2025-03-04 10:34:14,059 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 10:34:14,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 710 SyntacticMatches, 27 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=735, Invalid=5427, Unknown=0, NotChecked=0, Total=6162 [2025-03-04 10:34:14,061 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:14,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 10:34:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-04 10:34:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 420 states have (on average 1.1071428571428572) internal successors, (465), 420 states have internal predecessors, (465), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 10:34:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 481 transitions. [2025-03-04 10:34:14,115 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 481 transitions. Word has length 373 [2025-03-04 10:34:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:14,115 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 481 transitions. [2025-03-04 10:34:14,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.425) internal successors, (97), 35 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 10:34:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 481 transitions. [2025-03-04 10:34:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-04 10:34:14,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:14,118 INFO L218 NwaCegarLoop]: trace histogram [88, 88, 88, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:14,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:14,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:14,320 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:14,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1794707948, now seen corresponding path program 12 times [2025-03-04 10:34:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:14,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086565237] [2025-03-04 10:34:14,320 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:34:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:14,331 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 402 statements into 28 equivalence classes. [2025-03-04 10:34:14,373 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 293 of 402 statements. [2025-03-04 10:34:14,373 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-04 10:34:14,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13290 backedges. 5809 proven. 4003 refuted. 0 times theorem prover too weak. 3478 trivial. 0 not checked. [2025-03-04 10:34:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086565237] [2025-03-04 10:34:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086565237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154830625] [2025-03-04 10:34:14,786 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:34:14,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:14,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:14,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-04 10:34:14,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:34:14,968 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 402 statements into 28 equivalence classes. [2025-03-04 10:34:15,043 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 293 of 402 statements. [2025-03-04 10:34:15,043 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-04 10:34:15,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:15,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:34:15,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13290 backedges. 5809 proven. 4003 refuted. 0 times theorem prover too weak. 3478 trivial. 0 not checked. [2025-03-04 10:34:15,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13290 backedges. 5809 proven. 4003 refuted. 0 times theorem prover too weak. 3478 trivial. 0 not checked. [2025-03-04 10:34:16,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154830625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:16,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:16,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2025-03-04 10:34:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268139884] [2025-03-04 10:34:16,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:16,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 10:34:16,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:16,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 10:34:16,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2207, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:34:16,686 INFO L87 Difference]: Start difference. First operand 436 states and 481 transitions. Second operand has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 46 states have internal predecessors, (114), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 10:34:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:19,185 INFO L93 Difference]: Finished difference Result 1465 states and 1668 transitions. [2025-03-04 10:34:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2025-03-04 10:34:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 46 states have internal predecessors, (114), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 402 [2025-03-04 10:34:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:19,189 INFO L225 Difference]: With dead ends: 1465 [2025-03-04 10:34:19,189 INFO L226 Difference]: Without dead ends: 1124 [2025-03-04 10:34:19,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12686 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6997, Invalid=26675, Unknown=0, NotChecked=0, Total=33672 [2025-03-04 10:34:19,193 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:19,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-03-04 10:34:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 535. [2025-03-04 10:34:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 517 states have (on average 1.1237911025145069) internal successors, (581), 517 states have internal predecessors, (581), 3 states have call successors, (3), 2 states have call predecessors, (3), 14 states have return successors, (15), 15 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 10:34:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 599 transitions. [2025-03-04 10:34:19,252 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 599 transitions. Word has length 402 [2025-03-04 10:34:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:19,252 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 599 transitions. [2025-03-04 10:34:19,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 46 states have internal predecessors, (114), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 10:34:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 599 transitions. [2025-03-04 10:34:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 10:34:19,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:19,256 INFO L218 NwaCegarLoop]: trace histogram [117, 117, 117, 17, 16, 16, 16, 16, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:19,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:19,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:19,460 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:19,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1976619384, now seen corresponding path program 13 times [2025-03-04 10:34:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:19,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014534560] [2025-03-04 10:34:19,461 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:34:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:19,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 10:34:19,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 10:34:19,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:19,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 23174 backedges. 8697 proven. 1335 refuted. 0 times theorem prover too weak. 13142 trivial. 0 not checked. [2025-03-04 10:34:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014534560] [2025-03-04 10:34:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014534560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547505614] [2025-03-04 10:34:20,603 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:34:20,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:20,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:20,605 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:20,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:34:20,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 10:34:20,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 10:34:20,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:20,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:20,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 10:34:20,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23174 backedges. 8716 proven. 1316 refuted. 0 times theorem prover too weak. 13142 trivial. 0 not checked. [2025-03-04 10:34:21,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23174 backedges. 8716 proven. 1316 refuted. 0 times theorem prover too weak. 13142 trivial. 0 not checked. [2025-03-04 10:34:26,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547505614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:26,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:26,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 42 [2025-03-04 10:34:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496166200] [2025-03-04 10:34:26,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:26,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 10:34:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:26,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 10:34:26,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 10:34:26,654 INFO L87 Difference]: Start difference. First operand 535 states and 599 transitions. Second operand has 42 states, 42 states have (on average 2.3333333333333335) internal successors, (98), 34 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:27,416 INFO L93 Difference]: Finished difference Result 980 states and 1109 transitions. [2025-03-04 10:34:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-03-04 10:34:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.3333333333333335) internal successors, (98), 34 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 521 [2025-03-04 10:34:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:27,419 INFO L225 Difference]: With dead ends: 980 [2025-03-04 10:34:27,419 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 10:34:27,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1129 GetRequests, 1003 SyntacticMatches, 37 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2891 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1132, Invalid=7058, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 10:34:27,421 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:27,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 10:34:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-04 10:34:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 543 states have (on average 1.1197053406998159) internal successors, (608), 543 states have internal predecessors, (608), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 10:34:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 627 transitions. [2025-03-04 10:34:27,482 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 627 transitions. Word has length 521 [2025-03-04 10:34:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:27,482 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 627 transitions. [2025-03-04 10:34:27,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.3333333333333335) internal successors, (98), 34 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 627 transitions. [2025-03-04 10:34:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-04 10:34:27,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:27,486 INFO L218 NwaCegarLoop]: trace histogram [123, 123, 123, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:27,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:34:27,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:27,686 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:27,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash -332995269, now seen corresponding path program 14 times [2025-03-04 10:34:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072687533] [2025-03-04 10:34:27,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:27,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 540 statements into 2 equivalence classes. [2025-03-04 10:34:27,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 540 of 540 statements. [2025-03-04 10:34:27,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:27,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25539 backedges. 9937 proven. 429 refuted. 0 times theorem prover too weak. 15173 trivial. 0 not checked. [2025-03-04 10:34:28,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:28,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072687533] [2025-03-04 10:34:28,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072687533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:28,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451425841] [2025-03-04 10:34:28,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:28,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:28,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:28,765 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:28,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:34:29,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 540 statements into 2 equivalence classes. [2025-03-04 10:34:29,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 540 of 540 statements. [2025-03-04 10:34:29,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:29,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:29,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 10:34:29,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25539 backedges. 9867 proven. 499 refuted. 0 times theorem prover too weak. 15173 trivial. 0 not checked. [2025-03-04 10:34:29,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25539 backedges. 9867 proven. 499 refuted. 0 times theorem prover too weak. 15173 trivial. 0 not checked. [2025-03-04 10:34:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451425841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:35,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:35,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 40 [2025-03-04 10:34:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660317776] [2025-03-04 10:34:35,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:35,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:34:35,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:35,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:34:35,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1343, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:34:35,486 INFO L87 Difference]: Start difference. First operand 562 states and 627 transitions. Second operand has 40 states, 40 states have (on average 2.375) internal successors, (95), 32 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:36,134 INFO L93 Difference]: Finished difference Result 980 states and 1108 transitions. [2025-03-04 10:34:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 10:34:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.375) internal successors, (95), 32 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 540 [2025-03-04 10:34:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:36,137 INFO L225 Difference]: With dead ends: 980 [2025-03-04 10:34:36,137 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 10:34:36,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1152 GetRequests, 1042 SyntacticMatches, 36 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2533 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=878, Invalid=4822, Unknown=0, NotChecked=0, Total=5700 [2025-03-04 10:34:36,140 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:36,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:34:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 10:34:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-04 10:34:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 543 states have (on average 1.1049723756906078) internal successors, (600), 543 states have internal predecessors, (600), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 16 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 10:34:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 619 transitions. [2025-03-04 10:34:36,198 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 619 transitions. Word has length 540 [2025-03-04 10:34:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:36,198 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 619 transitions. [2025-03-04 10:34:36,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.375) internal successors, (95), 32 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 619 transitions. [2025-03-04 10:34:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-04 10:34:36,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:36,202 INFO L218 NwaCegarLoop]: trace histogram [124, 124, 124, 18, 17, 17, 17, 17, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:36,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:36,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:34:36,403 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:36,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1516414017, now seen corresponding path program 15 times [2025-03-04 10:34:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978085354] [2025-03-04 10:34:36,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:36,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 553 statements into 28 equivalence classes. [2025-03-04 10:34:36,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 365 of 553 statements. [2025-03-04 10:34:36,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-04 10:34:36,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 11862 proven. 7858 refuted. 0 times theorem prover too weak. 6362 trivial. 0 not checked. [2025-03-04 10:34:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978085354] [2025-03-04 10:34:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978085354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24180047] [2025-03-04 10:34:37,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:37,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:37,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:37,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:37,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:34:37,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 553 statements into 28 equivalence classes. [2025-03-04 10:34:37,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 365 of 553 statements. [2025-03-04 10:34:37,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-04 10:34:37,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:37,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:34:37,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 11862 proven. 7858 refuted. 0 times theorem prover too weak. 6362 trivial. 0 not checked. [2025-03-04 10:34:37,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 11862 proven. 7858 refuted. 0 times theorem prover too weak. 6362 trivial. 0 not checked. [2025-03-04 10:34:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24180047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:40,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2025-03-04 10:34:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009402906] [2025-03-04 10:34:40,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:40,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 10:34:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:40,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 10:34:40,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=3185, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 10:34:40,696 INFO L87 Difference]: Start difference. First operand 562 states and 619 transitions. Second operand has 62 states, 61 states have (on average 2.2295081967213113) internal successors, (136), 54 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:45,195 INFO L93 Difference]: Finished difference Result 2199 states and 2507 transitions. [2025-03-04 10:34:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2025-03-04 10:34:45,196 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.2295081967213113) internal successors, (136), 54 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 553 [2025-03-04 10:34:45,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:45,202 INFO L225 Difference]: With dead ends: 2199 [2025-03-04 10:34:45,202 INFO L226 Difference]: Without dead ends: 1773 [2025-03-04 10:34:45,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1075 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28151 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=14041, Invalid=54341, Unknown=0, NotChecked=0, Total=68382 [2025-03-04 10:34:45,208 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:45,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-03-04 10:34:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 679. [2025-03-04 10:34:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 658 states have (on average 1.121580547112462) internal successors, (738), 658 states have internal predecessors, (738), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (18), 18 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 10:34:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 759 transitions. [2025-03-04 10:34:45,307 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 759 transitions. Word has length 553 [2025-03-04 10:34:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:45,307 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 759 transitions. [2025-03-04 10:34:45,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.2295081967213113) internal successors, (136), 54 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 759 transitions. [2025-03-04 10:34:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-04 10:34:45,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:45,311 INFO L218 NwaCegarLoop]: trace histogram [159, 159, 159, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:45,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:34:45,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:45,512 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:45,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1724063291, now seen corresponding path program 16 times [2025-03-04 10:34:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:45,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615668584] [2025-03-04 10:34:45,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:45,527 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 670 statements into 2 equivalence classes. [2025-03-04 10:34:45,839 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 670 of 670 statements. [2025-03-04 10:34:45,839 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:45,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 41916 backedges. 16347 proven. 254 refuted. 0 times theorem prover too weak. 25315 trivial. 0 not checked. [2025-03-04 10:34:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615668584] [2025-03-04 10:34:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615668584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249836640] [2025-03-04 10:34:47,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:47,141 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:47,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:34:47,509 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 670 statements into 2 equivalence classes. [2025-03-04 10:34:47,609 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 670 of 670 statements. [2025-03-04 10:34:47,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:47,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:47,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 10:34:47,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 41916 backedges. 15203 proven. 2126 refuted. 0 times theorem prover too weak. 24587 trivial. 0 not checked. [2025-03-04 10:34:48,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 41916 backedges. 15203 proven. 2126 refuted. 0 times theorem prover too weak. 24587 trivial. 0 not checked. [2025-03-04 10:34:57,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249836640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:57,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:57,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 45, 45] total 60 [2025-03-04 10:34:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795626739] [2025-03-04 10:34:57,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:57,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-04 10:34:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:57,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-04 10:34:57,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3210, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 10:34:57,494 INFO L87 Difference]: Start difference. First operand 679 states and 759 transitions. Second operand has 60 states, 60 states have (on average 2.283333333333333) internal successors, (137), 51 states have internal predecessors, (137), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 10:34:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:58,584 INFO L93 Difference]: Finished difference Result 1244 states and 1405 transitions. [2025-03-04 10:34:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-03-04 10:34:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.283333333333333) internal successors, (137), 51 states have internal predecessors, (137), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 670 [2025-03-04 10:34:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:58,587 INFO L225 Difference]: With dead ends: 1244 [2025-03-04 10:34:58,587 INFO L226 Difference]: Without dead ends: 709 [2025-03-04 10:34:58,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1454 GetRequests, 1275 SyntacticMatches, 42 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2301, Invalid=16881, Unknown=0, NotChecked=0, Total=19182 [2025-03-04 10:34:58,590 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:58,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-04 10:34:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2025-03-04 10:34:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 687 states have (on average 1.1179039301310043) internal successors, (768), 687 states have internal predecessors, (768), 3 states have call successors, (3), 2 states have call predecessors, (3), 18 states have return successors, (19), 19 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 10:34:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 790 transitions. [2025-03-04 10:34:58,689 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 790 transitions. Word has length 670 [2025-03-04 10:34:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:58,689 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 790 transitions. [2025-03-04 10:34:58,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.283333333333333) internal successors, (137), 51 states have internal predecessors, (137), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 10:34:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 790 transitions. [2025-03-04 10:34:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2025-03-04 10:34:58,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:58,693 INFO L218 NwaCegarLoop]: trace histogram [167, 167, 167, 21, 20, 20, 20, 20, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:58,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:34:58,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:58,894 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:58,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1371590312, now seen corresponding path program 17 times [2025-03-04 10:34:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456620012] [2025-03-04 10:34:58,896 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:58,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 715 statements into 30 equivalence classes. [2025-03-04 10:34:58,966 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 551 of 715 statements. [2025-03-04 10:34:58,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-04 10:34:58,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 46497 backedges. 23432 proven. 1570 refuted. 0 times theorem prover too weak. 21495 trivial. 0 not checked. [2025-03-04 10:35:00,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456620012] [2025-03-04 10:35:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456620012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964973116] [2025-03-04 10:35:00,106 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:35:00,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:00,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:00,108 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:00,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:35:00,578 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 715 statements into 30 equivalence classes. [2025-03-04 10:35:00,682 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 551 of 715 statements. [2025-03-04 10:35:00,682 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-04 10:35:00,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:00,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 10:35:00,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46497 backedges. 23499 proven. 1661 refuted. 0 times theorem prover too weak. 21337 trivial. 0 not checked. [2025-03-04 10:35:00,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 46497 backedges. 23797 proven. 1363 refuted. 0 times theorem prover too weak. 21337 trivial. 0 not checked. [2025-03-04 10:35:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964973116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:10,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:10,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 47, 47] total 56 [2025-03-04 10:35:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217539181] [2025-03-04 10:35:10,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-04 10:35:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:10,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-04 10:35:10,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=2753, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 10:35:10,033 INFO L87 Difference]: Start difference. First operand 709 states and 790 transitions. Second operand has 56 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 49 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:35:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:11,991 INFO L93 Difference]: Finished difference Result 1283 states and 1447 transitions. [2025-03-04 10:35:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-03-04 10:35:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 49 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 715 [2025-03-04 10:35:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:11,995 INFO L225 Difference]: With dead ends: 1283 [2025-03-04 10:35:11,995 INFO L226 Difference]: Without dead ends: 718 [2025-03-04 10:35:11,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1568 GetRequests, 1379 SyntacticMatches, 40 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7690 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3052, Invalid=19598, Unknown=0, NotChecked=0, Total=22650 [2025-03-04 10:35:11,998 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:11,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:35:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-04 10:35:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2025-03-04 10:35:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 696 states have (on average 1.081896551724138) internal successors, (753), 696 states have internal predecessors, (753), 3 states have call successors, (3), 2 states have call predecessors, (3), 18 states have return successors, (19), 19 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 10:35:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 775 transitions. [2025-03-04 10:35:12,144 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 775 transitions. Word has length 715 [2025-03-04 10:35:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:12,144 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 775 transitions. [2025-03-04 10:35:12,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 49 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:35:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 775 transitions. [2025-03-04 10:35:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-03-04 10:35:12,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:12,149 INFO L218 NwaCegarLoop]: trace histogram [170, 170, 170, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1] [2025-03-04 10:35:12,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 10:35:12,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:12,349 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1743163620, now seen corresponding path program 18 times [2025-03-04 10:35:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111387121] [2025-03-04 10:35:12,350 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:35:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:12,374 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 714 statements into 30 equivalence classes. [2025-03-04 10:35:12,474 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) and asserted 714 of 714 statements. [2025-03-04 10:35:12,474 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2025-03-04 10:35:12,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat