./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.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 d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:44:10,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:44:10,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:44:10,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:44:10,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:44:10,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:44:10,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:44:10,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:44:10,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:44:10,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:44:10,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:44:10,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:44:10,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:44:10,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:44:10,979 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:44:10,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:44:10,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:44:10,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:44:10,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:44:10,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:44:10,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:44:10,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:44:10,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:44:10,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:44:10,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:44:10,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:44:10,982 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 -> d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a [2025-03-17 14:44:11,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:44:11,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:44:11,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:44:11,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:44:11,227 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:44:11,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2025-03-17 14:44:12,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b304668e/e4ea009b80734953ab2687a4d53f5017/FLAGf926342a3 [2025-03-17 14:44:12,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:44:12,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2025-03-17 14:44:12,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b304668e/e4ea009b80734953ab2687a4d53f5017/FLAGf926342a3 [2025-03-17 14:44:12,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b304668e/e4ea009b80734953ab2687a4d53f5017 [2025-03-17 14:44:12,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:44:12,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:44:12,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:44:12,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:44:12,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:44:12,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154c3213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12, skipping insertion in model container [2025-03-17 14:44:12,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:44:12,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:44:12,796 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:44:12,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:44:12,817 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:44:12,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12 WrapperNode [2025-03-17 14:44:12,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:44:12,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:44:12,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:44:12,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:44:12,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,838 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2025-03-17 14:44:12,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:44:12,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:44:12,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:44:12,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:44:12,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,849 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:44:12,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:44:12,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:44:12,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:44:12,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:44:12,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (1/1) ... [2025-03-17 14:44:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:44:12,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:12,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:44:12,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:44:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2025-03-17 14:44:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2025-03-17 14:44:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2025-03-17 14:44:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2025-03-17 14:44:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:44:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:44:12,939 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:44:12,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:44:13,023 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; [2025-03-17 14:44:13,047 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret3;havoc #t~ret4; [2025-03-17 14:44:13,064 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 14:44:13,065 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:44:13,074 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:44:13,074 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:44:13,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:13 BoogieIcfgContainer [2025-03-17 14:44:13,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:44:13,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:44:13,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:44:13,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:44:13,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:44:12" (1/3) ... [2025-03-17 14:44:13,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcfb0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:44:13, skipping insertion in model container [2025-03-17 14:44:13,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:12" (2/3) ... [2025-03-17 14:44:13,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcfb0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:44:13, skipping insertion in model container [2025-03-17 14:44:13,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:13" (3/3) ... [2025-03-17 14:44:13,082 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1a-2.c [2025-03-17 14:44:13,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:44:13,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_1a-2.c that has 3 procedures, 45 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-17 14:44:13,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:44:13,148 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;@1672a8b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:44:13,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:44:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.5) internal successors, (39), 36 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:44:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:44:13,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:13,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:44:13,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:13,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2047198646, now seen corresponding path program 1 times [2025-03-17 14:44:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075716555] [2025-03-17 14:44:13,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:13,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:44:13,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:44:13,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:13,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:13,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075716555] [2025-03-17 14:44:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075716555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420023365] [2025-03-17 14:44:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:13,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:13,304 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.5) internal successors, (39), 36 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 14:44:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:13,338 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-17 14:44:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:13,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-03-17 14:44:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:13,345 INFO L225 Difference]: With dead ends: 47 [2025-03-17 14:44:13,345 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 14:44:13,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:13,351 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:13,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 14:44:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-17 14:44:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 14:44:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-03-17 14:44:13,388 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2025-03-17 14:44:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:13,390 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-17 14:44:13,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 14:44:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-03-17 14:44:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:44:13,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:13,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:13,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:44:13,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:13,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 961351416, now seen corresponding path program 1 times [2025-03-17 14:44:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908903968] [2025-03-17 14:44:13,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:13,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:44:13,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:44:13,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:13,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908903968] [2025-03-17 14:44:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908903968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:13,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:44:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817097562] [2025-03-17 14:44:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:13,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:44:13,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:13,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:44:13,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:13,471 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. 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-17 14:44:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:13,531 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-03-17 14:44:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:44:13,531 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-17 14:44:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:13,533 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:44:13,533 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 14:44:13,534 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-17 14:44:13,534 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:13,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 155 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 14:44:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-17 14:44:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 14:44:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-03-17 14:44:13,551 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 7 [2025-03-17 14:44:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:13,551 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-17 14:44:13,551 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-17 14:44:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-03-17 14:44:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:44:13,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:13,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:13,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:44:13,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1647804014, now seen corresponding path program 1 times [2025-03-17 14:44:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186864659] [2025-03-17 14:44:13,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:13,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:44:13,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:44:13,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:13,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:13,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186864659] [2025-03-17 14:44:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186864659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:13,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:13,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:13,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150032634] [2025-03-17 14:44:13,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:13,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:13,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:13,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:13,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:13,581 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:13,592 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-03-17 14:44:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:13,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:44:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:13,593 INFO L225 Difference]: With dead ends: 52 [2025-03-17 14:44:13,593 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 14:44:13,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:13,594 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:13,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 14:44:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-17 14:44:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 14:44:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-17 14:44:13,603 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 11 [2025-03-17 14:44:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:13,603 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-17 14:44:13,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-17 14:44:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:44:13,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:13,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:13,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:44:13,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:13,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash 457683103, now seen corresponding path program 1 times [2025-03-17 14:44:13,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:13,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562052890] [2025-03-17 14:44:13,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:13,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:13,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:44:13,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:44:13,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:13,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562052890] [2025-03-17 14:44:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562052890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:44:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855337056] [2025-03-17 14:44:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:13,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:44:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:13,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:44:13,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:13,704 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:13,835 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-17 14:44:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:44:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:44:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:13,837 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:44:13,839 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:44:13,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:44:13,840 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:13,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 187 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:44:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2025-03-17 14:44:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 14:44:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-03-17 14:44:13,855 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 12 [2025-03-17 14:44:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:13,855 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-03-17 14:44:13,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-03-17 14:44:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:44:13,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:13,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:13,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:44:13,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:13,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1879074504, now seen corresponding path program 1 times [2025-03-17 14:44:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:13,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427550489] [2025-03-17 14:44:13,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:13,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:44:13,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:44:13,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:13,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427550489] [2025-03-17 14:44:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427550489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:13,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:13,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304951918] [2025-03-17 14:44:13,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:13,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:44:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:13,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:44:13,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:13,907 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:13,960 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2025-03-17 14:44:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:44:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-17 14:44:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:13,961 INFO L225 Difference]: With dead ends: 128 [2025-03-17 14:44:13,961 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 14:44:13,962 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-17 14:44:13,962 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:13,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 102 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 14:44:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-03-17 14:44:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 52 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 14:44:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-03-17 14:44:13,975 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 18 [2025-03-17 14:44:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:13,975 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-03-17 14:44:13,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-03-17 14:44:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:44:13,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:13,976 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:44:13,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:13,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash -967026894, now seen corresponding path program 1 times [2025-03-17 14:44:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728094514] [2025-03-17 14:44:13,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:13,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:44:13,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:44:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:13,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:14,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728094514] [2025-03-17 14:44:14,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728094514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:14,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:14,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:14,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045488735] [2025-03-17 14:44:14,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:14,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:14,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:14,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:14,029 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:14,056 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-03-17 14:44:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-17 14:44:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:14,058 INFO L225 Difference]: With dead ends: 90 [2025-03-17 14:44:14,058 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 14:44:14,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:14,059 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 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-17 14:44:14,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 14:44:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2025-03-17 14:44:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 56 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 14:44:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-03-17 14:44:14,075 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2025-03-17 14:44:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:14,076 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-03-17 14:44:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-03-17 14:44:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:44:14,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:14,076 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:14,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:44:14,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:14,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash 86937337, now seen corresponding path program 1 times [2025-03-17 14:44:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237875250] [2025-03-17 14:44:14,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:14,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:44:14,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:44:14,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237875250] [2025-03-17 14:44:14,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237875250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:14,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862258782] [2025-03-17 14:44:14,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:14,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:14,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:14,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:14,105 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:14,118 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2025-03-17 14:44:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 14:44:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:14,119 INFO L225 Difference]: With dead ends: 73 [2025-03-17 14:44:14,119 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 14:44:14,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:14,120 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 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-17 14:44:14,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 14:44:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 14:44:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 55 states have internal predecessors, (63), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 14:44:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-03-17 14:44:14,126 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 20 [2025-03-17 14:44:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:14,126 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-17 14:44:14,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-03-17 14:44:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 14:44:14,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:14,127 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:14,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:44:14,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:14,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 28736568, now seen corresponding path program 1 times [2025-03-17 14:44:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:14,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141648814] [2025-03-17 14:44:14,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:14,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:44:14,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:44:14,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141648814] [2025-03-17 14:44:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141648814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828163662] [2025-03-17 14:44:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:14,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:14,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:14,217 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:14,273 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2025-03-17 14:44:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 14:44:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:14,277 INFO L225 Difference]: With dead ends: 156 [2025-03-17 14:44:14,277 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 14:44:14,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:44:14,278 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:14,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 14:44:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2025-03-17 14:44:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 62 states have internal predecessors, (68), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-17 14:44:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2025-03-17 14:44:14,293 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 25 [2025-03-17 14:44:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:14,295 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2025-03-17 14:44:14,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2025-03-17 14:44:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 14:44:14,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:14,296 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:44:14,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -177877977, now seen corresponding path program 1 times [2025-03-17 14:44:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139070895] [2025-03-17 14:44:14,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:14,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:44:14,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:44:14,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:44:14,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139070895] [2025-03-17 14:44:14,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139070895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:14,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:14,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:14,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350268563] [2025-03-17 14:44:14,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:14,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:14,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:14,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:14,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:14,380 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:14,433 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2025-03-17 14:44:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-17 14:44:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:14,434 INFO L225 Difference]: With dead ends: 168 [2025-03-17 14:44:14,434 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 14:44:14,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:44:14,435 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:14,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 195 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 14:44:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2025-03-17 14:44:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 67 states have internal predecessors, (73), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 14:44:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2025-03-17 14:44:14,445 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 36 [2025-03-17 14:44:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:14,445 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2025-03-17 14:44:14,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2025-03-17 14:44:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 14:44:14,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:14,450 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:44:14,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -577239338, now seen corresponding path program 1 times [2025-03-17 14:44:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631993355] [2025-03-17 14:44:14,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:14,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:44:14,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:44:14,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:44:14,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631993355] [2025-03-17 14:44:14,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631993355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:14,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:14,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74823474] [2025-03-17 14:44:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:14,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:14,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:14,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:14,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:14,487 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:14,495 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2025-03-17 14:44:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-03-17 14:44:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:14,497 INFO L225 Difference]: With dead ends: 88 [2025-03-17 14:44:14,497 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 14:44:14,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:14,498 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 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-17 14:44:14,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 14:44:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 14:44:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 66 states have internal predecessors, (71), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 14:44:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-03-17 14:44:14,507 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 33 [2025-03-17 14:44:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:14,507 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-03-17 14:44:14,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-03-17 14:44:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:44:14,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:14,511 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:14,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:44:14,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:14,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 803806914, now seen corresponding path program 1 times [2025-03-17 14:44:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:14,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359381860] [2025-03-17 14:44:14,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:44:14,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:44:14,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 14:44:14,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359381860] [2025-03-17 14:44:14,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359381860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:14,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:14,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785023669] [2025-03-17 14:44:14,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:14,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:14,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:14,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:14,556 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:14,571 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2025-03-17 14:44:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-17 14:44:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:14,572 INFO L225 Difference]: With dead ends: 94 [2025-03-17 14:44:14,572 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 14:44:14,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:14,573 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:14,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 14:44:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 14:44:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 70 states have internal predecessors, (77), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 14:44:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2025-03-17 14:44:14,584 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 39 [2025-03-17 14:44:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:14,586 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2025-03-17 14:44:14,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2025-03-17 14:44:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 14:44:14,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:14,586 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:14,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:44:14,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:14,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1062262698, now seen corresponding path program 1 times [2025-03-17 14:44:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:14,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846272421] [2025-03-17 14:44:14,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:14,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:44:14,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:44:14,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 14:44:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846272421] [2025-03-17 14:44:14,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846272421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:14,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:14,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140908228] [2025-03-17 14:44:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:14,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:14,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:14,657 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:14,703 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2025-03-17 14:44:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-03-17 14:44:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:14,704 INFO L225 Difference]: With dead ends: 103 [2025-03-17 14:44:14,704 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 14:44:14,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:14,705 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:14,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 212 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 14:44:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2025-03-17 14:44:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 69 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 14:44:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2025-03-17 14:44:14,718 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 48 [2025-03-17 14:44:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:14,718 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2025-03-17 14:44:14,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2025-03-17 14:44:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 14:44:14,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:14,719 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:14,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:44:14,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:14,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1715962245, now seen corresponding path program 1 times [2025-03-17 14:44:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024162507] [2025-03-17 14:44:14,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:14,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:44:14,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:44:14,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024162507] [2025-03-17 14:44:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024162507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978119274] [2025-03-17 14:44:14,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:14,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:14,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:44:14,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:44:14,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:44:14,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:14,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:14,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:44:14,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:14,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978119274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:15,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 14:44:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69072744] [2025-03-17 14:44:15,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:44:15,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:44:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:44:15,025 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 14:44:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,218 INFO L93 Difference]: Finished difference Result 194 states and 253 transitions. [2025-03-17 14:44:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:44:15,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-03-17 14:44:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,219 INFO L225 Difference]: With dead ends: 194 [2025-03-17 14:44:15,219 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 14:44:15,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:44:15,220 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:15,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 381 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 14:44:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 117. [2025-03-17 14:44:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 87 states have internal predecessors, (95), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (34), 22 states have call predecessors, (34), 19 states have call successors, (34) [2025-03-17 14:44:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2025-03-17 14:44:15,230 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 42 [2025-03-17 14:44:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,230 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2025-03-17 14:44:15,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 14:44:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2025-03-17 14:44:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 14:44:15,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,231 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:44:15,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:44:15,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash -228476748, now seen corresponding path program 1 times [2025-03-17 14:44:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583350830] [2025-03-17 14:44:15,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 14:44:15,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 14:44:15,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:44:15,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:15,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583350830] [2025-03-17 14:44:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583350830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:15,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:15,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539144559] [2025-03-17 14:44:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:15,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:15,466 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,481 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2025-03-17 14:44:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:15,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2025-03-17 14:44:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,483 INFO L225 Difference]: With dead ends: 131 [2025-03-17 14:44:15,483 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 14:44:15,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:15,483 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:15,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 14:44:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2025-03-17 14:44:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 94 states have internal predecessors, (103), 20 states have call successors, (20), 7 states have call predecessors, (20), 12 states have return successors, (40), 25 states have call predecessors, (40), 19 states have call successors, (40) [2025-03-17 14:44:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2025-03-17 14:44:15,490 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 44 [2025-03-17 14:44:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,490 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2025-03-17 14:44:15,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2025-03-17 14:44:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 14:44:15,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,491 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:44:15,491 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash -583613776, now seen corresponding path program 1 times [2025-03-17 14:44:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216911878] [2025-03-17 14:44:15,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 14:44:15,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:44:15,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 14:44:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:15,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216911878] [2025-03-17 14:44:15,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216911878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:15,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421521797] [2025-03-17 14:44:15,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:15,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:15,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:15,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:44:15,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 14:44:15,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 14:44:15,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:44:15,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 14:44:15,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:44:15,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421521797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:15,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:44:15,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-17 14:44:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885707830] [2025-03-17 14:44:15,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:15,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:44:15,622 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,709 INFO L93 Difference]: Finished difference Result 161 states and 206 transitions. [2025-03-17 14:44:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:44:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2025-03-17 14:44:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,710 INFO L225 Difference]: With dead ends: 161 [2025-03-17 14:44:15,710 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 14:44:15,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:44:15,711 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:15,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 181 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 14:44:15,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2025-03-17 14:44:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 114 states have internal predecessors, (125), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (47), 31 states have call predecessors, (47), 24 states have call successors, (47) [2025-03-17 14:44:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 197 transitions. [2025-03-17 14:44:15,733 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 197 transitions. Word has length 54 [2025-03-17 14:44:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,733 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 197 transitions. [2025-03-17 14:44:15,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 197 transitions. [2025-03-17 14:44:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 14:44:15,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,733 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:15,936 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,SelfDestructingSolverStorable14 [2025-03-17 14:44:15,937 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1507155398, now seen corresponding path program 1 times [2025-03-17 14:44:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778730253] [2025-03-17 14:44:15,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 14:44:15,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:44:15,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:44:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778730253] [2025-03-17 14:44:15,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778730253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:15,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:15,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:15,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450578675] [2025-03-17 14:44:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:15,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:15,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:15,965 INFO L87 Difference]: Start difference. First operand 154 states and 197 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,974 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2025-03-17 14:44:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2025-03-17 14:44:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,976 INFO L225 Difference]: With dead ends: 154 [2025-03-17 14:44:15,976 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 14:44:15,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:15,977 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 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-17 14:44:15,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 14:44:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-17 14:44:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.1121495327102804) internal successors, (119), 111 states have internal predecessors, (119), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (45), 30 states have call predecessors, (45), 24 states have call successors, (45) [2025-03-17 14:44:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2025-03-17 14:44:15,989 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 45 [2025-03-17 14:44:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,989 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2025-03-17 14:44:15,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2025-03-17 14:44:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 14:44:15,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,991 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:44:15,991 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1952120334, now seen corresponding path program 1 times [2025-03-17 14:44:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920964687] [2025-03-17 14:44:15,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 14:44:16,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 14:44:16,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 77 proven. 56 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-17 14:44:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920964687] [2025-03-17 14:44:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920964687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129240370] [2025-03-17 14:44:16,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:16,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:16,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:44:16,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 14:44:16,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 14:44:16,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:44:16,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 77 proven. 56 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-17 14:44:16,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 77 proven. 57 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-17 14:44:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129240370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:16,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 14 [2025-03-17 14:44:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131569969] [2025-03-17 14:44:16,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:44:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:44:16,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:44:16,646 INFO L87 Difference]: Start difference. First operand 150 states and 189 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 9 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-17 14:44:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,850 INFO L93 Difference]: Finished difference Result 236 states and 326 transitions. [2025-03-17 14:44:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:44:16,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 9 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) Word has length 108 [2025-03-17 14:44:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,852 INFO L225 Difference]: With dead ends: 236 [2025-03-17 14:44:16,852 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 14:44:16,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:44:16,852 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 49 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 210 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 14:44:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 177. [2025-03-17 14:44:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 126 states have (on average 1.1031746031746033) internal successors, (139), 129 states have internal predecessors, (139), 30 states have call successors, (30), 8 states have call predecessors, (30), 17 states have return successors, (64), 39 states have call predecessors, (64), 29 states have call successors, (64) [2025-03-17 14:44:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 233 transitions. [2025-03-17 14:44:16,871 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 233 transitions. Word has length 108 [2025-03-17 14:44:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,871 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 233 transitions. [2025-03-17 14:44:16,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 9 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-17 14:44:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 233 transitions. [2025-03-17 14:44:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 14:44:16,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,873 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:17,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:17,078 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:17,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1509217501, now seen corresponding path program 1 times [2025-03-17 14:44:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070961632] [2025-03-17 14:44:17,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:17,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 14:44:17,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 14:44:17,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:17,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 95 proven. 93 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-17 14:44:17,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:17,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070961632] [2025-03-17 14:44:17,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070961632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:17,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453798250] [2025-03-17 14:44:17,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:17,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:17,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:17,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:17,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:44:17,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 14:44:17,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 14:44:17,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:17,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:17,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:44:17,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 246 proven. 35 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-17 14:44:17,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 95 proven. 93 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-17 14:44:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453798250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:17,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2025-03-17 14:44:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518524075] [2025-03-17 14:44:17,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:44:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:17,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:44:17,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:44:17,493 INFO L87 Difference]: Start difference. First operand 177 states and 233 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 6 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 14:44:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:17,765 INFO L93 Difference]: Finished difference Result 391 states and 510 transitions. [2025-03-17 14:44:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:44:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 6 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 114 [2025-03-17 14:44:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:17,768 INFO L225 Difference]: With dead ends: 391 [2025-03-17 14:44:17,768 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 14:44:17,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 220 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:44:17,769 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 63 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:17,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 317 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:44:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 14:44:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 195. [2025-03-17 14:44:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 139 states have (on average 1.1079136690647482) internal successors, (154), 144 states have internal predecessors, (154), 33 states have call successors, (33), 10 states have call predecessors, (33), 19 states have return successors, (60), 40 states have call predecessors, (60), 32 states have call successors, (60) [2025-03-17 14:44:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2025-03-17 14:44:17,785 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 114 [2025-03-17 14:44:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:17,785 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2025-03-17 14:44:17,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 6 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 14:44:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2025-03-17 14:44:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 14:44:17,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:17,787 INFO L218 NwaCegarLoop]: trace histogram [11, 8, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:17,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:17,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:44:17,991 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:17,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1199637311, now seen corresponding path program 2 times [2025-03-17 14:44:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:17,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018982934] [2025-03-17 14:44:17,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:17,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:17,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-17 14:44:18,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 14:44:18,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:18,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-17 14:44:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018982934] [2025-03-17 14:44:18,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018982934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:18,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:44:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124321674] [2025-03-17 14:44:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:44:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:18,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:44:18,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:18,084 INFO L87 Difference]: Start difference. First operand 195 states and 247 transitions. Second operand has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:18,151 INFO L93 Difference]: Finished difference Result 196 states and 247 transitions. [2025-03-17 14:44:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:44:18,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 84 [2025-03-17 14:44:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:18,152 INFO L225 Difference]: With dead ends: 196 [2025-03-17 14:44:18,152 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 14:44:18,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:18,153 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:18,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 14:44:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2025-03-17 14:44:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 143 states have internal predecessors, (153), 33 states have call successors, (33), 10 states have call predecessors, (33), 19 states have return successors, (60), 40 states have call predecessors, (60), 32 states have call successors, (60) [2025-03-17 14:44:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2025-03-17 14:44:18,164 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 84 [2025-03-17 14:44:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:18,164 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2025-03-17 14:44:18,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2025-03-17 14:44:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 14:44:18,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:18,165 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:18,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:44:18,165 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:18,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1302295041, now seen corresponding path program 2 times [2025-03-17 14:44:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137454952] [2025-03-17 14:44:18,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:44:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:18,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-17 14:44:18,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 14:44:18,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:44:18,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 14:44:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:18,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137454952] [2025-03-17 14:44:18,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137454952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:18,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:18,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:44:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473371605] [2025-03-17 14:44:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:18,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:44:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:18,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:44:18,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:44:18,252 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:44:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:18,293 INFO L93 Difference]: Finished difference Result 194 states and 246 transitions. [2025-03-17 14:44:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:44:18,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-03-17 14:44:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:18,295 INFO L225 Difference]: With dead ends: 194 [2025-03-17 14:44:18,295 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 14:44:18,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:44:18,296 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:18,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 175 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 14:44:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2025-03-17 14:44:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.0804597701149425) internal successors, (94), 89 states have internal predecessors, (94), 19 states have call successors, (19), 7 states have call predecessors, (19), 11 states have return successors, (32), 22 states have call predecessors, (32), 16 states have call successors, (32) [2025-03-17 14:44:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2025-03-17 14:44:18,302 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 84 [2025-03-17 14:44:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:18,303 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2025-03-17 14:44:18,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:44:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2025-03-17 14:44:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 14:44:18,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:18,304 INFO L218 NwaCegarLoop]: trace histogram [23, 21, 15, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:18,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:44:18,304 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:18,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash 50870114, now seen corresponding path program 1 times [2025-03-17 14:44:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797387919] [2025-03-17 14:44:18,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:18,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 14:44:18,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 14:44:18,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:18,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 65 proven. 203 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-03-17 14:44:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797387919] [2025-03-17 14:44:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797387919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418121569] [2025-03-17 14:44:18,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:18,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:18,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:18,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:18,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:44:18,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 14:44:18,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 14:44:18,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:18,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:18,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:44:18,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 657 proven. 28 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2025-03-17 14:44:18,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 65 proven. 203 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-03-17 14:44:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418121569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:18,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-03-17 14:44:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421551339] [2025-03-17 14:44:18,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:18,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:44:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:18,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:44:18,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:44:18,745 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 14:44:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:18,804 INFO L93 Difference]: Finished difference Result 176 states and 218 transitions. [2025-03-17 14:44:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:44:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 183 [2025-03-17 14:44:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:18,805 INFO L225 Difference]: With dead ends: 176 [2025-03-17 14:44:18,805 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:44:18,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 360 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:44:18,806 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:18,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:44:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:44:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:44:18,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2025-03-17 14:44:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:18,807 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:44:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-17 14:44:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:44:18,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:44:18,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-17 14:44:18,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-17 14:44:18,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-17 14:44:18,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-17 14:44:18,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-17 14:44:18,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-17 14:44:18,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-17 14:44:18,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-17 14:44:18,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-17 14:44:18,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-17 14:44:18,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:19,015 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:19,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:44:19,640 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:44:19,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:44:19 BoogieIcfgContainer [2025-03-17 14:44:19,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:44:19,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:44:19,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:44:19,646 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:44:19,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:13" (3/4) ... [2025-03-17 14:44:19,648 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:44:19,653 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec1 [2025-03-17 14:44:19,653 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec2 [2025-03-17 14:44:19,655 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 14:44:19,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:44:19,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 14:44:19,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:44:19,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:44:19,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:44:19,713 INFO L158 Benchmark]: Toolchain (without parser) took 7040.05ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 106.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2025-03-17 14:44:19,713 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:44:19,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.21ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 113.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:44:19,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.32ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:44:19,714 INFO L158 Benchmark]: Boogie Preprocessor took 13.46ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.6MB in the end (delta: 837.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:44:19,714 INFO L158 Benchmark]: IcfgBuilder took 220.75ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 99.9MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:44:19,714 INFO L158 Benchmark]: TraceAbstraction took 6569.07ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 112.6MB in the end (delta: -13.2MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2025-03-17 14:44:19,714 INFO L158 Benchmark]: Witness Printer took 66.56ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 106.4MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:44:19,715 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.21ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 113.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.32ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.46ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.6MB in the end (delta: 837.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 220.75ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 99.9MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6569.07ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 112.6MB in the end (delta: -13.2MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Witness Printer took 66.56ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 106.4MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 57 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 21, TraceHistogramMax: 23, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 3248 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2405 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1298 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 843 mSDtfsCounter, 1298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1103 GetRequests, 941 SyntacticMatches, 21 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=18, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 248 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1533 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1950 ConstructedInterpolants, 0 QuantifiedInterpolants, 2962 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1004 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 5527/6359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 14:44:19,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE